The complexity of computations by networks

Authors:
Nicholas Pippenger
Affiliations:
-
Venue:
IBM Journal of Research and Development - Mathematics and computing
Year:
1987

Citing 17
Cited 6

Separating the polynomial-time hierarchy by oracles

Proc. 26th annual symposium on Foundations of computer science
Depth-size trade-offs for parallel prefix computation

Journal of Algorithms
Nearly optimal hierarchies for network and formula size

Acta Informatica
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Almost optimal lower bounds for small depth circuits

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Monotone versus positive

Journal of the ACM (JACM)
On the Time Required to Perform Addition

Journal of the ACM (JACM)
On the Time Required to Perform Multiplication

Journal of the ACM (JACM)
Parallel Prefix Computation

Journal of the ACM (JACM)
Bounding Fan-out in Logical Networks

Journal of the ACM (JACM)
Lower Bounds for Constant Depth Circuits for Prefix Problems

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Threshold functions and bounded deptii monotone circuits

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On monotone formulae with restricted depth

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Superconcentrators, generalizers and generalized connectors with limited depth

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Unbounded fan-in circuits and associative functions

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Borel sets and circuit complexity

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
New bounds for parallel prefix circuits

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Depth-Size Tradeoffs for Neural Computation

IEEE Transactions on Computers - Special issue on artificial neural networks
Simulating threshold circuits by majority circuits

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses

IEEE Transactions on Parallel and Distributed Systems
Functional and dynamic programming in the design of parallel prefix networks

Journal of Functional Programming
Quantum addition circuits and unbounded fan-out

Quantum Information & Computation
The complexity of game isomorphism

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey the current state of knowledge concerning the computation of Boolean functions by networks, with particular emphasis on the addition and multiplication of binary numbers.