Login / Signup

The Complexity of Satisfiability of Small Depth Circuits.

Chris CalabroRussell ImpagliazzoRamamohan Paturi
Published in: IWPEC (2009)
Keyphrases
  • computational complexity
  • np complete
  • satisfiability problem
  • depth information
  • genetic algorithm
  • small number
  • high speed
  • propositional logic
  • worst case
  • search space
  • infrared
  • decision problems
  • modal logic