A taxonomy of complexity classes of functions (Q1329166): Difference between revisions

@@ Property / author @@
-Selman, Alan L.
@@ Property / author: Selman, Alan L. / rank @@
-Normal rank
@@ Property / author @@
+Selman, Alan L.
@@ Property / author: Selman, Alan L. / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+P-Printable Sets
@@ Property / cites work: P-Printable Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Quantitative Relativizations of Complexity Classes
+Normal rank
@@ Property / cites work @@
+On the power of parity polynomial time
@@ Property / cites work: On the power of parity polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+Normal rank
@@ Property / cites work @@
+Q3328286
@@ Property / cites work: Q3328286 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Measures for Public-Key Cryptosystems
@@ Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+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 @@
+Polynomial Time Enumeration Reducibility
@@ Property / cites work: Polynomial Time Enumeration Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Natural Self-Reducible Sets
@@ Property / cites work: Natural Self-Reducible Sets / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of one-way functions in complexity theory
+Normal rank
@@ Property / cites work @@
+On polynomial-time truth-table reducibility of intractable sets to P-selective sets
+Normal rank
@@ Property / cites work @@
+Relative complexity of checking and evaluating
@@ Property / cites work: Relative complexity of checking and evaluating / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Query Classes
@@ Property / cites work: Bounded Query Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Structural analysis of the complexity of inverse functions
+Normal rank