A Lower Bound on Determinantal Complexity
From MaRDI portal
Publication:6348447
DOI10.1007/s00037-022-00228-3arXiv2009.02452MaRDI QIDQ6348447
Publication date: 4 September 2020
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Networks and circuits as models of computation; circuit complexity (68Q06)
This page was built for publication: A Lower Bound on Determinantal Complexity