351 search results - page 1 / 71 » A Survey of Lower Bounds for Satisfiability and Related Prob... |
FTTCS
2006
13 years 5 months ago
2006
ASIACRYPT
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
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...
MP
2006
13 years 5 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
CC
2006
Springer
13 years 5 months ago
2006
Springer
We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.