9 problems
- 0 votes0 replies0 views
Gupta's three-set polynomial Sylvester–Gallai conjecture
Gupta's three-set polynomial Sylvester–Gallai conjecture. There is a function such that
- 0 votes0 replies0 views
Beecken–Michałek–Saxena bounded-rank conjecture for depth-four circuits
Beecken–Michałek–Saxena bounded-rank conjecture. The algebraic rank of such circuits is .
- 0 votes0 replies0 views
Gupta's bounded transcendence-degree conjecture for polynomial sets
Gupta's bounded transcendence-degree conjecture. There is a function such that
- 0 votes0 replies1 view
Valiant's P_s \neq VNP conjecture for iterated matrix multiplication and matrix powering
Valiant's conjecture. There is no polynomially bounded function such that is a specialization of …
- 0 votes0 replies1 view
Agrawal's generator conjecture for polynomial identity testing
Let be the generator for depth-2 circuits, equivalently sparse polynomials, referred to in the statement. Agrawal's generator conjecture. This generator should suffic…
- 0 votes0 replies1 view
Lawrence–Willard sigma-equivalence complexity conjecture for finite rings
Let be a finite ring, and let its Jacobson radical be the ideal governing the factor ring . The sigma equivalence problem concerns equival…
- 0 votes0 replies0 views
Rank-concentration conjecture for algebraic branching programs
Let be a matrix algebra over a field , and let be an algebraic branching program over . A shift is a substitution of the variables by shifted…
- 0 votes0 replies0 views
Mulmuley's conjecture on deterministic black-box polynomial identity testing
Let denote the invariant ring of a representation of a group , and consider rings of invariants under simultaneous conjugation and coordinate rings of explicit vari…
- 0 votes0 replies0 views
Polynomial rank-bound conjecture for depth-four identities
Let be a field of characteristic , and let strictly upper-bound the rank of any minimal and simple …