A. Subramanian. The Computational Complexity of the Circuit Value and Network Stability Problems. PhD thesis, Department of Computer Science, Stanford University, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (14 citations) (Correct)
....Anderson, also unpublished, has improved the algorithms so as to use only p n processors. Mayr and Subramanian note that these algorithms are P complete, in the sense of Section . It is known that NL CC P [MS89] Most of the results described in this subsection come from [MS89] See also [Sub90, Sub89, Fed89]. B.4.1 Comparator Circuit Value Problem (CCVP) Given: An encoding ff of a circuit ff composed of comparator gates plus inputs x 1 ; x n . A comparator gate outputs the minimum of its two inputs on its first output wire and outputs the maximum of its two inputs on its second output wire. ....
A. Subramanian. The Computational Complexity of the Circuit Value and Network Stability Problems. PhD thesis, Department of Computer Science, Stanford University, 1990.
A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (14 citations) (Correct)
....Anderson, also unpublished, has improved the algorithms so as to use only p n processors. Mayr and Subramanian note that these algorithms are P complete, in the sense of Section . It is known that NL CC P [MS89] Most of the results described in this subsection come from [MS89] See also [Sub90, Sub89, Fed89]. B.4.1 Comparator Circuit Value Problem (CCVP) Given: An encoding ff of a circuit ff composed of comparator gates plus inputs x 1 ; x n . A comparator gate outputs the minimum of its two inputs on its first output wire and outputs the maximum of its two inputs on its second output wire. ....
A. Subramanian. The Computational Complexity of the Circuit Value and Network Stability Problems. PhD thesis, Department of Computer Science, Stanford University, 1990.
On the Fourier Analysis of Boolean Functions - Bernasconi, Codenotti, Simon (1996) (1 citation) (Correct)
No context found.
A. Subramanian. The Computational Complexity of the Circuit Value and Network Stability Problems. PhD Thesis, Tech. Report No. STAN-CS-90-1311, Stanford University (1990).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC