The complexity of computations by networks

DOI10.1147/RD.312.0235MaRDI QIDQ3799628zbMATH OpenOpenAlexFDO

Authors Nicholas Pippenger

Publication date 1987

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://scholarship.claremont.edu/hmc_fac_pub/617

zbMATH Keywords

computation of Boolean functions by networksmultiplication of binary numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3848612
• Complexity of networks
• scientific article; zbMATH DE number 4026814
• An axiomatic approach to network complexity
• Advances in network complexity
• Algorithmic complexity of power law networks
• scientific article; zbMATH DE number 512920

Cited in

(10)

• The complexity of reconfiguring network models
• Functional and dynamic programming in the design of parallel prefix networks
• The computational power of simple protocols for self-awareness on graphs
• On small depth threshold circuits
• Time and Energy Complexity of Function Computation Over Networks
• The computational complexity of the criticality problems in a network with interval activity times
• Bounds for parallel addition time of two numbers
• The complexity of game isomorphism
• A new minimax theorem for randomized algorithms
• Size-depth trade-offs for monotone arithmetic circuits

This page was built for publication: The complexity of computations by networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799628)