144 search results - page 3 / 29 » Time-Space Tradeoffs for Satisfiability |
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Nepomnjascii's Theorem states that for all 0 < 1 and k > 0 the class of languages recognized in nondeterministic time nk and space n , NTISP[nk , n ], is contained in ...
ECCC
2007
13 years 5 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
IJCAI
2007
13 years 7 months ago
2007
We investigate three parameterized algorithmic schemes for graphical models that can accommodate trade-offs between time and space: 1) AND/OR Adaptive Caching (AOC(i)); 2) Variabl...
ECCC
2008
13 years 5 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...