Low-depth arithmetic circuit lower bounds: bypassing set-multilinearization
From MaRDI portal
Cited in
(5)- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- Low-depth algebraic circuit lower bounds over any field
- NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
- Monotone bounded-depth complexity of homomorphism polynomials
- Multi-quadratic sum-of-squares lower bounds imply VNC^1 VNP
This page was built for publication: Low-depth arithmetic circuit lower bounds: bypassing set-multilinearization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638003)