Files in this item

FilesDescriptionFormat

application/pdf

application/pdfB37-ACT_74.pdf (8MB)
(no description provided)PDF

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:Coordinated Science Laboratory
Series/Report:Coordinated Science Laboratory Report no. UILU-ENG-87-2202, ACT-74
Genre:Report
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


This item appears in the following Collection(s)

Item Statistics