Recursion theoretic characterizations of complexity classes of counting functions (Q1365942): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(95)00237-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2068563862
@@ Property / OpenAlex ID: W2068563862 / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetization: A new method in structural complexity theory
+Normal rank
@@ Property / cites work @@
+Q4321931
@@ Property / cites work: Q4321931 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035303
@@ Property / cites work: Q4035303 / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetical problems and recursively enumerable predicates
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+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 @@
+A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Expressibility and Parallel Complexity
@@ Property / cites work: Expressibility and Parallel Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+An arithmetical characterization of NP
@@ Property / cites work: An arithmetical characterization of NP / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity theory for feasible closure properties
+Normal rank
@@ Property / cites work @@
+On closure properties of GapP
@@ Property / cites work: On closure properties of GapP / rank @@
+Normal rank
@@ Property / cites work @@
+PP is as Hard as the Polynomial-Time Hierarchy
@@ Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank @@
+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 @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classes of optimization functions
@@ Property / cites work: Complexity classes of optimization functions / rank @@
+Normal rank
@@ Property / cites work @@
+Some observations on the connection between counting and recursion
+Normal rank
@@ Property / cites work @@
+Q3707407
@@ Property / cites work: Q3707407 / rank @@
+Normal rank