1920 search results - page 16 / 384 » The Complexity of the A B C Problem |
156
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
128
click to vote
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
147
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
150
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
148
click to vote
EUROCAST
2005
Springer
15 years 11 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...