ECCC-Report TR12-071https://eccc.weizmann.ac.il/report/2012/071Comments and Revisions published for TR12-071en-usTue, 29 May 2012 15:22:34 +0300
Paper TR12-071
| A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis |
Kazuhisa Seto,
Suguru Tamaki
https://eccc.weizmann.ac.il/report/2012/071We present a moderately exponential time algorithm for the satisfiability of Boolean formulas over the full binary basis.
For formulas of size at most $cn$, our algorithm runs in time $2^{(1-\mu_c)n}$ for some constant $\mu_c>0$.
As a byproduct of the running time analysis of our algorithm,
we get strong average-case hardness of affine extractors for linear-sized formulas over the full binary basis.Tue, 29 May 2012 15:22:34 +0300https://eccc.weizmann.ac.il/report/2012/071