Dehn algorithm
E265416
UNEXPLORED
The Dehn algorithm is a decision procedure in combinatorial group theory that solves the word problem for certain groups by systematically reducing words using defining relations.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.