The complexity of computations by networks

From MaRDI portal

Publication:3799628

Jump to:navigation, search

DOI10.1147/rd.312.0235zbMath0653.68016OpenAlexW2031414318MaRDI QIDQ3799628

Nicholas J. 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

multiplication of binary numbers computation of Boolean functions by networks

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (5)

On small depth threshold circuits ⋮ Bounds for parallel addition time of two numbers ⋮ The complexity of game isomorphism ⋮ Functional and dynamic programming in the design of parallel prefix networks ⋮ Size-depth trade-offs for monotone arithmetic circuits

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3799628&oldid=17367226"

Pages with script errors