1379 search results - page 79 / 276 » The Complexity of the Annihilating Polynomial |
115
click to vote
JSAT
2007
15 years 6 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...
168
click to vote
ALGORITHMICA
2002
15 years 6 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...
184
click to vote
CORR
2010
Springer
15 years 4 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 ...
152
click to vote
ALDT
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
159
click to vote
APPROX
2009
Springer
16 years 26 days ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...