Login / Signup
On Solving Hard Problems by Polynomial-Size Circuits.
Dung T. Huynh
Published in:
Inf. Process. Lett. (1987)
Keyphrases
</>
solving hard
combinatorial problems
search problems
satisfiability problem
optimization problems
polynomial size
np complete
traveling salesman problem
learning theory
sat problem
propositional satisfiability