Efficient algorithms for highly compressed data: the word problem in Higman's group is in P.

From MaRDI portal









Describes a project that uses

Uses Software






This page was built for publication: Efficient algorithms for highly compressed data: the word problem in Higman's group is in P.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904514)