Bounded query machines: on NP and PSPACE (Q1158751): Difference between revisions

@@ Property / cites work @@
+Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
+Normal rank
@@ Property / cites work @@
+A second step toward the polynomial hierarchy
@@ Property / cites work: A second step toward the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+On Languages Accepted in Polynomial Time
@@ Property / cites work: On Languages Accepted in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Space and Transitive Closure
@@ Property / cites work: Polynomial Space and Transitive Closure / rank @@
+Normal rank
@@ Property / cites work @@
+On languages accepted by space-bounded oracle machines
+Normal rank
@@ Property / cites work @@
+On languages specified by relative acceptance
@@ Property / cites work: On languages specified by relative acceptance / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded query machines: on NP( ) and NPQUERY( )
@@ Property / cites work: Bounded query machines: on NP( ) and NPQUERY( ) / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy for nondeterministic time complexity
@@ Property / cites work: A hierarchy for nondeterministic time complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Separating Nondeterministic Time Complexity Classes
+Normal rank
@@ Property / cites work @@
+The lattices of prefixes and overlaps of traces
@@ Property / cites work: The lattices of prefixes and overlaps of traces / rank @@
+Normal rank
@@ Property / cites work @@
+Rudimentary Predicates and Relative Computation
@@ Property / cites work: Rudimentary Predicates and Relative Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Time- and tape-bounded Turing acceptors and AFLs
@@ Property / cites work: Time- and tape-bounded Turing acceptors and AFLs / rank @@
+Normal rank