A lower bound on determinantal complexity

DOI10.1007/s00037-022-00228-3MaRDI QIDQ2087768

Mrinal Kumar, Ben lee Volk

Publication date: 21 October 2022

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.02452

zbMATH Keywords

lower bounds; algebraic complexity theory; algebraic circuits; determinantal complexity

Mathematics Subject Classification ID

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

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

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

Uses Software

• GitHub
• lowerbounds-survey