The complexity of ODDnA (Q4953205): Difference between revisions

@@ Property / author @@
-William I. Gasarch
@@ Property / author: William I. Gasarch / rank @@
-Normal rank
@@ Property / author @@
-Martin Kummer
@@ Property / author: Martin Kummer / rank @@
-Normal rank
@@ Property / author @@
-Georgia A. Martin
@@ Property / author: Georgia A. Martin / rank @@
-Normal rank
@@ Property / author @@
-Frank Stephan
@@ Property / author: Frank Stephan / rank @@
-Normal rank
@@ Property / author @@
+William I. Gasarch
@@ Property / author: William I. Gasarch / rank @@
+Normal rank
@@ Property / author @@
+Martin Kummer
@@ Property / author: Martin Kummer / rank @@
+Normal rank
@@ Property / author @@
+Georgia A. Martin
@@ Property / author: Georgia A. Martin / rank @@
+Normal rank
@@ Property / author @@
+Frank Stephan
@@ Property / author: Frank Stephan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2307/2586523
@@ Property / full work available at URL: https://doi.org/10.2307/2586523 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2575237024
@@ Property / OpenAlex ID: W2575237024 / rank @@
+Normal rank
@@ Property / cites work @@
+One way functions and pseudorandom generators
@@ Property / cites work: One way functions and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+The Degrees of Hyperimmune Sets
@@ Property / cites work: The Degrees of Hyperimmune Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerative counting is hard
@@ Property / cites work: Enumerative counting is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded query classes and the difference hierarchy
+Normal rank
@@ Property / cites work @@
+Terse, superterse, and verbose sets
@@ Property / cites work: Terse, superterse, and verbose sets / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical foundations of computer science 1996. 21st international symposium, MFCS '96, Cracow, Poland, September 2--6, 1996. Proceedings
+Normal rank
@@ Property / cites work @@
+Frequency computation and bounded queries
@@ Property / cites work: Frequency computation and bounded queries / rank @@
+Normal rank
@@ Property / cites work @@
+Convex subsets of \(2^n\) and bounded truth-table reducibility
+Normal rank
@@ Property / cites work @@
+Bounded queries in recursion theory
@@ Property / cites work: Bounded queries in recursion theory / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective Search Problems
@@ Property / cites work: Effective Search Problems / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4953205

The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205): Difference between revisions

Latest revision as of 14:58, 29 May 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)