1998 search results - page 108 / 400 » Complexity of the Cover Polynomial |
MST
2008
13 years 10 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
TCS
2008
13 years 10 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
JSAT
2007
13 years 10 months ago
2007
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
ALGORITHMICA
2002
13 years 10 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...