Complexity of the $r$-query tautologies in the presence of a generic oracle (Q1861135): Difference between revisions

@@ Property / cites work @@
+Q3220571
@@ Property / cites work: Q3220571 / rank @@
+Normal rank
@@ Property / cites work @@
+Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
+Normal rank
@@ Property / cites work @@
+On bounded query machines
@@ Property / cites work: On bounded query machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321931
@@ Property / cites work: Q4321931 / rank @@
+Normal rank
@@ Property / cites work @@
+Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
+Normal rank
@@ Property / cites work @@
+Bounded query machines: on NP and PSPACE
@@ Property / cites work: Bounded query machines: on NP and PSPACE / rank @@
+Normal rank
@@ Property / cites work @@
+THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS
@@ Property / cites work: THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS / rank @@
+Normal rank
@@ Property / cites work @@
+Generic oracles, uniform machines, and codes
@@ Property / cites work: Generic oracles, uniform machines, and codes / rank @@
+Normal rank
@@ Property / cites work @@
+Some applications of the notions of forcing and generic sets
+Normal rank
@@ Property / cites work @@
+Some applications of forcing to hierarchy problems in arithmetic
+Normal rank
@@ Property / cites work @@
+Q3905267
@@ Property / cites work: Q3905267 / rank @@
+Normal rank
@@ Property / cites work @@
+Set theory. An introduction to independence proofs
+Normal rank
@@ Property / cites work @@
+Forcing and reducibilities
@@ Property / cites work: Forcing and reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+Q3720579
@@ Property / cites work: Q3720579 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4246600
@@ Property / cites work: Q4246600 / rank @@
+Normal rank
@@ Property / cites work @@
+On relativized probabilistic polynomial time algorithms
+Normal rank

Complexity of the \(r\)-query tautologies in the presence of a generic oracle (Q1861135): Difference between revisions

Latest revision as of 12:46, 5 June 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)