612 search results - page 8 / 123 » Hardness assumptions in the foundations of theoretical compu... |
CC
2007
Springer
13 years 7 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
ICALP
2003
Springer
14 years 26 days ago
2003
Springer
FOCS
2002
IEEE
14 years 19 days ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
SPIN
2004
Springer
14 years 1 months ago
2004
Springer
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution