On Limited Nondeterminism and ACC Circuit Lower Bounds

From MaRDI portal
Revision as of 18:23, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2798730


DOI10.1007/978-3-319-30000-9_25zbMath1443.68064MaRDI QIDQ2798730

Holger Spakowski

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30000-9_25


68Q25: Analysis of algorithms and problem complexity

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