2412 search results - page 85 / 483 » Which Problems Have Strongly Exponential Complexity |
101
click to vote
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
153
click to vote
DLOG
2007
15 years 5 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
133
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
130
Voted
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
120
click to vote
IJON
2010
15 years 12 days ago
2010
Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a ...