Login / Signup

A Variety with Undecidable Equational Theory and Solvable Word Problem.

Sinisa CrvenkovicIgor Dolinka
Published in: Int. J. Algebra Comput. (1998)
Keyphrases
  • word problems
  • np complete
  • equational theories
  • theorem proving
  • computational complexity
  • special case
  • np hard
  • sufficient conditions