Quasipolynomial-time conjecture for equations over finite solvable groups
Statement
Let be a finite solvable group. The problems and ask, respectively, whether an equation over has a satisfying assignment and whether it is an identity over all assignments. Quasipolynomial-time conjecture. Both and are decidable in quasipolynomial time. This is presented as a natural weakening of an earlier polynomial-time question after the paper proves ETH-based quasipolynomial lower bounds for some solvable groups; the conjecture remains open in the stated generality.
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.