scientific article; zbMATH DE number 7075875

zbMath1409.68127MaRDI QIDQ4967171

Ramprasad Saptharishi

Publication date: 3 July 2019

Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/293/275

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Quadratic lower bounds for algebraic branching programs and formulas ⋮ Depth-4 lower bounds, determinantal complexity: a unified approach ⋮ Lower bounds for special cases of syntactic multilinear ABPs ⋮ Factorization of polynomials given by arithmetic branching programs ⋮ A quadratic lower bound for algebraic branching programs ⋮ A quadratic lower bound for homogeneous algebraic branching programs ⋮ A lower bound on determinantal complexity

This page was built for publication: