Login / Signup

Undecidable properties of monoids with word problem solvable in linear time.

Masashi KatsuraYuji Kobayashi
Published in: Theor. Comput. Sci. (2003)
Keyphrases
  • word problems
  • np complete
  • special case
  • np hard
  • sufficient conditions
  • learning environment
  • worst case
  • collaborative learning
  • learning systems