ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MM be a finitely presented special monoid, generated by AA, with virtually free group of units. For inputs u,v∈A∗u,v\in A^*, write n=∣u∣+∣v∣n=|u|+|v|. Quadratic-time word problem conjecture. The word problem for MM is decidable in O(n2)O(n^2) time. Matrix multiplication has the lower bound O(n2)O(n^2), so this conjecture would make the current reduction-based bound optimal. It is motivated by the conjectured optimal quadratic-time algorithm for matrix multiplication.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.