R. Szelepcsenyi. The method of forcing for nondeterministic automata. Bull. European Assoc. Theoret. Comput. Sci., 33:96-100, 1987. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets - Cai, Sivakumar (1995) (3 citations) (Correct)
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis - Cai, Sivakumar (Correct)
On the Complexity of the st-Connectivity Problem - Poon (1996) (Correct)
Time-Space Tradeoffs for Graph s-t Connectivity - Barnes (1992) (Correct)
An Unambiguous Class Possessing a Complete Set - Lange (1996) (4 citations) (Correct)
Lower Bounds for Deterministic and Nondeterministic Branching.. - Razborov (1991) (50 citations) (Correct)
Δ-Languages for Sets and LOGSPACE Computable Graph.. - Lisitsa, Sazonov (1997) (1 citation) (Correct)
A Note on Read-k Times Branching Programs - Jukna (1995) (4 citations) (Correct)
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets - Cai, Sivakumar (1995) (3 citations) (Correct)
Random Walks on Colored Graphs - Condon, Hernek (1994) (1 citation) (Correct)
Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (5 citations) (Correct)
Structure in Monotone Complexity - Grigni (1991) (1 citation) (Correct)
RUSPACE(log n) \subseteq DSPACE(log² n/log log n) - Allender, Lange (Correct)
Monotone Complexity - Grigni, Sipser (1990) (4 citations) (Correct)
On Bounded Set Theory - Sazonov (1997) (4 citations) (Correct)
Method Schemas - Abiteboul, Kanellakis, Ramaswamy.. (1992) (8 citations) (Correct)
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets - Cai, Sivakumar (1995) (3 citations) (Correct)
Nondeterminism, Fairness and a Fundamental Analogy - Spaan, Torenvliet, Boas (Correct)
Tight Lower Bounds for st-Connectivity on the NNJAG Model - Edmonds, Poon, Achlioptas (1999) (1 citation) (Correct)
StUSPACE(log n) \subseteq DSPACE(log² n/ log log n) - Allender, Lange (Correct)
Completeness for Nondeterministic Complexity Classes - Buhrman, Homer, Torenvliet (1991) (4 citations) (Correct)
Monotone Separation of Logarithmic Space from Logarithmic Depth - Grigni, Sipser (1995) (2 citations) (Correct)
On Lower Bounds for Read-k-Times - Borodin, Razborov, Smolensky (Correct)
Extensions of an Idea of McNaughton - Barrington (1993) (1 citation) (Correct)
Nondeterministic Space is Closed Under Complementation - Immerman (1988) (154 citations) (Correct)
First 50 documents
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