Definability by Constant-Depth Polynomial-Size Circuits

Larry Denenberg Yuri Gurevich Saharon Shelah

Published in: Inf. Control. (1986)

Keyphrases

polynomial size
exponential size
boolean functions
dnf formulas
knowledge compilation
propositional logic
fixed point
bounded treewidth
search space
data management