Login / Signup

FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems.

Friedrich OttoAndrea Sattler-Klein
Published in: FCT (1997)
Keyphrases
  • word problems
  • np complete
  • computational complexity
  • special case