S.R. Buss, "The Boolean Formula Value Problem is in ALOGTIME," Proc. 19th Ann. ACM Symp. on Theory of Comput., (1987), pp. 123--131. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
On the Parallel Complexity of Tree Automata - Lohrey (2001) (8 citations) (Correct)
Completeness results for Graph Isomorphism - Jenner, Köbler, al. (2002) (1 citation) (Correct)
Finite Presentations of Infinite Structures: Automata and.. - Blumensath, Grädel (2002) (1 citation) (Correct)
Circuits and Expressions with Non-Associative Gates - Berman, Drisko, Lemieux.. (1 citation) (Correct)
Al'orihms for Boolean Formul Evaluation nd for Tree.. - Miller And Reif (Correct)
The Fixpoint Bounded-Variable Queries are PSPACE-Complete - Dziembowski (1996) (Correct)
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis - Cai, Sivakumar (Correct)
The Complexity of Tensor Circuit Evaluation (Extended Abstract) - Beaudry, Holzer (Correct)
Size-Depth Tradeoffs for Algebraic Formulas - Bshouty, Cleve, Eberly (Correct)
McNaughton Languages - Beaudry, Holzer, Niemann, Otto (Correct)
Size-Depth Tradeoffs For Algebraic Formulas - Nader Bshouty And (Correct)
The Emptiness Problem for - Intersections Of Regular (Correct)
Finite Presentations of Infinite Structures: Automata and.. - Blumensath, Grädel (2004) (1 citation) (Correct)
PSPACE Contains Almost Complete Problems - Powell (2003) (Correct)
Quantified Propositional Calculus and a Second-Order Theory.. - Cook, Morioka (2004) (1 citation) (Correct)
Theories for Complexity Classes and their Propositional Translations - Cook (2004) (Correct)
M. Tompa. Two familiar transitive closure algorithms.. - Wrathall Complete Sets (Correct)
Subtree-Counting Loops - Lemieux, Moore, Thérien (Correct)
Are there Hard Examples for Frege Systems? - Bonet, Buss, Pitassi (1 citation) Self-citation (Buss) (Correct)
An Optimal Parallel Algorithm for Formula Evaluation - Buss, Cook, Gupta.. (1990) (28 citations) Self-citation (Buss) (Correct)
Propositional Consistency Proofs - Samuel Buss Department (1991) (4 citations) Self-citation (Buss) (Correct)
Alogtime Algorithms for Tree Isomorphism, Comparison, and.. - Buss Self-citation (Buss) (Correct)
Algorithms for Boolean Formula Evaluation and for Tree Contraction - Buss (1991) (11 citations) Self-citation (Buss) (Correct)
Propositional Consistency Proofs - Buss (1994) (4 citations) Self-citation (Buss) (Correct)
Are There Hard Examples for Frege Proof Systems? - Bonet, Buss, Pitassi (1995) (1 citation) Self-citation (Buss) (Correct)
First 50 documents Next 50
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