|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6751
| Title: | Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size |
| Authors: | Bilardi, Gianfranco
Preparata, Franco P. |
| Keywords: | computer science
technical report |
| Issue Date: | Apr-1988 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-911 |
| Abstract: | The prefix problem consists of computing all the products $x_{0}x_{1} \ldots x_{j} (j = 0, \ldots,N - 1)$, given a sequence $x =(x_{0},x_{1},\ldots, x_{N-1})$ of elements in a semigroup. It is shown that there are unbounded fan-in and fan-out boolean circuits for the prefix problem with constant depth and linear size if and only if the Cayley graph of the semigroup does not contain a special type of cycle called monoidal cycle. |
| URI: | http://hdl.handle.net/1813/6751 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
