Login / Signup
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs.
Chris Calabro
Russell Impagliazzo
Valentine Kabanets
Ramamohan Paturi
Published in:
Computational Complexity Conference (2003)
Keyphrases
</>
computational complexity
search strategies
satisfiability problem
neural network
genetic algorithm
objective function
upper bound
real valued
conjunctive normal form
sat solving