Subquadratic simulations of circuits by branching programs
Cai, J.-Y.
Lipton, R.J.
Dept. of Comput. Sci., Princeton Univ., NJ;
This paper appears in: Foundations of Computer Science, 1989., 30th Annual Symposium on
Publication Date: 30 Oct-1 Nov 1989
On page(s): 568-573
Meeting Date: 10/30/1989 - 11/01/1989
Location: Research Triangle Park, NC, USA
ISBN: 0-8186-1982-1
References Cited: 13
INSPEC Accession Number: 3753933
Digital Object Identifier: 10.1109/SFCS.1989.63536
Current Version Published: 2002-08-06
Abstract
Boolean circuits and their simulations by bounded-width branching
programs are considered. It is shown that every NC1 circuit
of size s can be simulated by a constant-width branching
program of length s1.811. . .. Some related
group-theoretic results are presented
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
