Files in this item
| Files | Description | Format |
|---|---|---|
|
application/pdf  B37-ACT_74.pdf (8MB) | (no description provided) |
Description
| Title: | Size-Time Complexity of Boolean Networks for Prefix Computations |
| Author(s): | Bilardi, G.; Preparata, F.P. |
| Subject(s): | Prefix problem
Boolean networks Cycle-freedom |
| Issue Date: | 1987-01 |
| Publisher: | Applied Computation Theory, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign |
| Series/Report: | Coordinated Science Laboratory Report no. UILU-ENG-87-2202, ACT-74 |
| Genre: | Report (Grant or Annual) |
| Type: | Text |
| Language: | English |
| Description: | Coordinated Science Laboratory was formerly known as Control Systems Laboratory |
| URI: | http://hdl.handle.net/2142/74253 |
| Sponsor: | National Science Foundation / DCI-8602256 and ECS-84-10902 |
| Date Available in IDEALS: | 2015-04-06 2017-07-14 |