On adaptive versus nonadaptive bounded query machines (Q808242): Difference between revisions

@@ Property / cites work @@
+Bounded queries to SAT and the Boolean hierarchy
@@ Property / cites work: Bounded queries to SAT and the Boolean hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Terse, superterse, and verbose sets
@@ Property / cites work: Terse, superterse, and verbose sets / rank @@
+Normal rank
@@ Property / cites work @@
+On Sets Truth-Table Reducible to Sparse Sets
@@ Property / cites work: On Sets Truth-Table Reducible to Sparse Sets / rank @@
+Normal rank
@@ Property / cites work @@
+The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Distinguishing conjunctive and disjunctive reducibilities by sparse sets
+Normal rank
@@ Property / cites work @@
+The difference and truth-table hierarchies for NP
@@ Property / cites work: The difference and truth-table hierarchies for NP / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of polynomial time reducibilities
@@ Property / cites work: A comparison of polynomial time reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+Q3807187
@@ Property / cites work: Q3807187 / rank @@
+Normal rank