Login / Signup
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract).
Cenny Wenner
Published in:
APPROX-RANDOM (2012)
Keyphrases
</>
extended abstract
closed form
satisfiability problem
error correction
error bounds
approximation algorithms
phase transition
randomly generated
queueing networks
approximation error
user defined
datalog programs
information retrieval
max sat
sat problem
efficient computation
special case
learning algorithm