Circuit complexity
From MaRDI portal
Publication:2817597
DOI10.1145/195058.195106zbMath1345.68160OpenAlexW2081890049MaRDI QIDQ2817597
Andreas Jakoby, Christian Schindelhauer, K. Ruediger Reischuk
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195106
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
The delay of circuits whose inputs have specified arrival times ⋮ Average circuit depth and average communication complexity ⋮ The average case complexity of the parallel prefix problem ⋮ Improving the average delay of sorting ⋮ Malign distributions for average case circuit complexity.
This page was built for publication: Circuit complexity
