Circuit complexity
From MaRDI portal
Publication:2817597
DOI10.1145/195058.195106zbMath1345.68160MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
The average case complexity of the parallel prefix problem, Average circuit depth and average communication complexity, Improving the average delay of sorting, Malign distributions for average case circuit complexity., The delay of circuits whose inputs have specified arrival times