Login / Signup

On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations.

Aleksi Saarela
Published in: Developments in Language Theory (2009)
Keyphrases
  • computational complexity
  • propositional logic
  • mathematical model
  • phase transition
  • satisfiability problem
  • space complexity
  • search space
  • computational cost
  • knowledge representation
  • worst case
  • von neumann