1998 search results - page 263 / 400 » Complexity of the Cover Polynomial |
138
Voted
SIAMCOMP
1998
15 years 13 days ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
112
Voted
CORR
2008
Springer
15 years 11 days ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
124
Voted
ECCC
2010
14 years 11 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
131
Voted
MODELS
2010
Springer
14 years 10 months ago
2010
Springer
Model transformation is one of the pillars of Model-Driven Engineering (MDE). The increasing complexity of systems and modelling languages has dramatically raised the complexity an...
120
Voted
BCB
2010
14 years 7 months ago
2010
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...