Complexity Reference: compref316 (BibTex)

Authors: Subramanian,A

Year: 1995

Title: The Parallel Complexity of Propagation in Boolean Circuits

Journal: Information and computation, 117, 266

Comments: Invwestigates the computational complexity of determining whether the output of a boolean circuit is determined by propogating some partial input.


| Top | Authors | Journals | Years | Keywords | Search | New | Comments |

Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University