Pages that link to "Item:Q4978011"
From MaRDI portal
The following pages link to Succinct hitting sets and barriers to proving algebraic circuits lower bounds (Q4978011):
Displaying 10 items.
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- (Q4612482) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- (Q5028363) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- (Q5121900) (← links)
- A PSPACE construction of a hitting set for the closure of small algebraic circuits (Q5230372) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Hitting sets and reconstruction for dense orbits in VPe and ΣΠΣ circuits (Q6115375) (← links)