On the autoreducibility of functions (Q970103): Difference between revisions

@@ Property / author @@
-Ogihara, Mitsunori
@@ Property / author: Ogihara, Mitsunori / rank @@
-Normal rank
@@ Property / author @@
+Ogihara, Mitsunori
@@ Property / author: Ogihara, Mitsunori / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2049926402
@@ Property / OpenAlex ID: W2049926402 / rank @@
+Normal rank
@@ Property / cites work @@
+On hiding information from an oracle
@@ Property / cites work: On hiding information from an oracle / rank @@
+Normal rank
@@ Property / cites work @@
+Q3337457
@@ Property / cites work: Q3337457 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-reducibility
@@ Property / cites work: Self-reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+On being incoherent without being very hard
@@ Property / cites work: On being incoherent without being very hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4293543
@@ Property / cites work: Q4293543 / rank @@
+Normal rank
@@ Property / cites work @@
+\(p\)-selective self-reducible sets: a new characterization of P
+Normal rank
@@ Property / cites work @@
+Separating Complexity Classes Using Autoreducibility
+Normal rank
@@ Property / cites work @@
+Random-Self-Reducibility of Complete Sets
@@ Property / cites work: Random-Self-Reducibility of Complete Sets / rank @@
+Normal rank
@@ Property / cites work @@
+The power of adaptiveness and additional queries in random-self- reductions
+Normal rank
@@ Property / cites work @@
+Gap-definable counting classes
@@ Property / cites work: Gap-definable counting classes / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Probabilistic Turing Machines
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+On the closure of certain function classes under integer division by polynomially-bounded functions
+Normal rank
@@ Property / cites work @@
+Closure properties and witness reduction
@@ Property / cites work: Closure properties and witness reduction / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity theory companion
@@ Property / cites work: The complexity theory companion / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
+Normal rank
@@ Property / cites work @@
+On counting and approximation
@@ Property / cites work: On counting and approximation / 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 @@
+Mitotic recursively enumerable sets
@@ Property / cites work: Mitotic recursively enumerable sets / rank @@
+Normal rank
@@ Property / cites work @@
+Relativization of questions about log space computability
+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 @@
+Q3210157
@@ Property / cites work: Q3210157 / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity theory for feasible closure properties
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Functions with Easy Decision Version
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classes defined by counting quantifiers
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942628
@@ Property / cites work: Q4942628 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of combinatorial problems with succinct input representation
+Normal rank
@@ Property / cites work @@
+Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
+Normal rank
@@ Property / cites work @@
+#P-COMPLETENESS VIA MANY-ONE REDUCTIONS
@@ Property / cites work: #P-COMPLETENESS VIA MANY-ONE REDUCTIONS / rank @@
+Normal rank