2661 search results - page 96 / 533 » Quantum Complexity Classes |
ICECCS
1997
IEEE
15 years 5 months ago
1997
IEEE
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames are intended to capture classes of recognisable and soluble problems. Because ...
112
Voted
GD
2009
Springer
15 years 4 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
93
Voted
JC
2002
15 years 15 days ago
2002
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
123
Voted
FOCS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
101
click to vote
EUROCOLT
1999
Springer
15 years 5 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...