Publication:5111149

DOI10.4230/LIPIcs.CCC.2017.19zbMath1440.68082MaRDI QIDQ5111149

Mrinal Kumar

Publication date: 26 May 2020

zbMATH Keywords

lower bounds; algebraic branching programs; arithmetic circuits; determinantal complexity

Mathematics Subject Classification ID

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

68Q06: Networks and circuits as models of computation; circuit complexity