Login / Signup
Polynomial-Time Functions Generate SAT: On P-Splinters.
Lane A. Hemachandra
Albrecht Hoene
Dirk Siefkes
Published in:
MFCS (1989)
Keyphrases
</>
special case
phase transition
sat solvers
propositional satisfiability
basis functions
satisfiability problem
sat problem
automatically generating
data sets
neural network
computational complexity
constraint satisfaction
automatically generate
sat solving