Size-time complexity of Boolean networks for prefix computations

DOI10.1145/62044.62052zbMath0679.68071OpenAlexW1965487578MaRDI QIDQ4729343

Gianfranco Bilardi, Franco P. Preparata

Publication date: 1989

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6645

zbMATH Keywords

computational complexityparallel computationBoolean networksmodels of computationprefix computationssize-time trade-offs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (6)

A chained-matrices approach for parallel computation of continued fractions and its applications ⋮ Inverting a Vandermonde matrix in minimum parallel time ⋮ Computations over finite monoids and their test complexity ⋮ The average case complexity of the parallel prefix problem ⋮ Circuits over monoids: A fault model, and a trade-off between testability and circuit delay ⋮ Limited width parallel prefix circuits

This page was built for publication: Size-time complexity of Boolean networks for prefix computations