DocumentCode :
2244363
Title :
Subquadratic simulations of circuits by branching programs
Author :
Cai, Jin-Yi ; Lipton, Richard J.
Author_Institution :
Dept. of Comput. Sci., Princeton Univ., NJ, USA
fYear :
1989
fDate :
30 Oct-1 Nov 1989
Firstpage :
568
Lastpage :
573
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
Keywords :
Boolean algebra; switching circuits; Boolean circuits; bounded-width; branching programs; group-theoretic results; simulations of circuits; subquadratic simulations; Binary decision diagrams; Circuit simulation; Computational modeling; Computer science; Computer simulation; Contracts; Encoding; Hardware; Polynomials; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1989., 30th Annual Symposium on
Conference_Location :
Research Triangle Park, NC
Print_ISBN :
0-8186-1982-1
Type :
conf
DOI :
10.1109/SFCS.1989.63536
Filename :
63536
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2244363
بازگشت