Size-Time Complexity of Boolean Networks for Prefix Computations

Bilardi, G.; Preparata, F.P.

Permalink

https://hdl.handle.net/2142/74253 Copy

Description

Title

Size-Time Complexity of Boolean Networks for Prefix Computations

Author(s)

• Bilardi, G.
• Preparata, F.P.

Issue Date

1987-01

Keyword(s)

• Prefix problem
• Boolean networks
• Cycle-freedom

Publisher

Applied Computation Theory, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign

Series/Report Name or Number

Coordinated Science Laboratory Report no. UILU-ENG-87-2202, ACT-74

Type of Resource

text

Language

English

Permalink

http://hdl.handle.net/2142/74253

Sponsor(s)/Grant Number(s)

National Science Foundation / DCI-8602256 and ECS-84-10902

Owning Collections