19 search results - page 1 / 4 » The consequences of eliminating NP solutions |
CSR
2008
Springer
13 years 4 months ago
2008
Springer
STOC
2010
ACM
14 years 1 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
AIPS
2008
13 years 6 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
CAV
2008
Springer
13 years 6 months ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
FSTTCS
1992
Springer
13 years 8 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...