Login / Signup

On the Complexity of Some Equivalence Problems for Propositional Calculi.

Steffen Reith
Published in: MFCS (2003)
Keyphrases
  • decision problems
  • polynomial hierarchy
  • np complete
  • neural network
  • lower bound
  • optimization problems
  • np hard
  • propositional logic
  • np hardness