Proof Complexity Lower Bounds from Algebraic Circuit Complexity
From MaRDI portal
Publication:5368766
DOI10.4230/LIPIcs.CCC.2016.32zbMath1380.68195arXiv1606.05050MaRDI QIDQ5368766
Amir Shpilka, Iddo Tzameret, Avi Wigderson, Michael A. Forbes
Publication date: 10 October 2017
Full work available at URL: https://arxiv.org/abs/1606.05050
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Unnamed Item ⋮ Resolution with counting: dag-like lower bounds and different moduli ⋮ Factorization of polynomials given by arithmetic branching programs ⋮ Unnamed Item ⋮ Factorization of polynomials given by arithmetic branching programs
This page was built for publication: Proof Complexity Lower Bounds from Algebraic Circuit Complexity
