Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with affine extractor:
TR12-071 | 29th May 2012
Kazuhisa Seto, Suguru Tamaki

A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis

We 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 ... more >>>

ISSN 1433-8092 | Imprint