Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical.

Niel de Beaudrap

Published in: TQC (2014)

Keyphrases

propositional satisfiability
stochastic local search
randomly generated
model counting
search algorithm
sat solvers
quantum computing
search space
sat instances
evolutionary algorithm
search procedures
np complete problems