Login / Signup
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four.
Cenny Wenner
Published in:
Theory Comput. (2013)
Keyphrases
</>
error correction
closed form
approximation algorithms
phase transition
satisfiability problem
randomly generated
neural network
np complete
user defined
bayesian networks
error bounds
efficient computation
queueing networks
subgraph isomorphism