Polynomial Whitehead-descent time-complexity conjecture
Statement
Let be a free group, let be the set of non-minimal elements, and let denote Whitehead complexity. Polynomial Whitehead-descent time-complexity conjecture. The time complexity, or at least the average-case time complexity, of Problem A on inputs is bounded above by
where is a fixed polynomial. This conjecture seeks a polynomial-in-rank complexity bound for solving Problem A on non-minimal inputs, proportional to Whitehead complexity and word length. The source gives no resolution status.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.