Login / Signup
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems.
Friedrich Otto
Andrea Sattler-Klein
Published in:
FCT (1997)
Keyphrases
</>
word problems
np complete
computational complexity
special case