Size-time complexity of Boolean networks for prefix computations.

Authors :: Bilardi, G.
Preparata, F. P.
Source :: Proceedings of the Nineteenth Annual ACM Symposium: Theory of Computing; 1/ 1/1987, p436-442, 7p
Publication Year :: 1987

Language :: English
ISBNs :: 9780897912211
Database :: Complementary Index
Journal :: Proceedings of the Nineteenth Annual ACM Symposium: Theory of Computing
Publication Type :: Conference
Accession number :: 84177940
Full Text :: https://doi.org/10.1145/28395.28442