Lower bounds for unrestricted Boolean circuits: open problems
From MaRDI portal
Publication:1625135
DOI10.1007/978-3-319-90530-3_2zbMath1484.68065OpenAlexW2799890067MaRDI QIDQ1625135
Publication date: 28 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-90530-3_2
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Networks and circuits as models of computation; circuit complexity (68Q06)
This page was built for publication: Lower bounds for unrestricted Boolean circuits: open problems
