Login / Signup

Completeness and Weak Completeness Under Polynomial-Size Circuits.

David W. JuedesJack H. Lutz
Published in: STACS (1995)
Keyphrases
  • polynomial size
  • exponential size
  • relational databases
  • computational complexity
  • dnf formulas