Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492851
DOI10.1007/11549345zbMath1156.68389MaRDI QIDQ5492851
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
A Short List of Equalities Induces Large Sign-Rank, On the relationship between energy complexity and other Boolean function measures, Size, Depth and Energy of Threshold Circuits Computing Parity Function., Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity, Monotone circuits for monotone weighted threshold functions