71 search results - page 15 / 15 » Approximating Boolean Functions by OBDDs |
115
click to vote
CC
2007
Springer
15 years 3 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 ...