Subtractive reductions and complete problems for counting complexity classes (Q2566034): Difference between revisions

@@ 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.1016/j.tcs.2005.03.012
+Normal rank
@@ Property / OpenAlex ID @@
+W4230626603
@@ Property / OpenAlex ID: W4230626603 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of model checking for circumscriptive formulae
+Normal rank
@@ Property / cites work @@
+Q4005188
@@ Property / cites work: Q4005188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938414
@@ Property / cites work: Q4938414 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+On counting and approximation
@@ Property / cites work: On counting and approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+Circumscription - a form of non-monotonic reasoning
+Normal rank
@@ Property / cites work @@
+A complexity theory for feasible closure properties
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Descriptive complexity of \(\#\)P functions
@@ Property / cites work: Descriptive complexity of \(\#\)P functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
+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 @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+The complexity of combinatorial problems with succinct input representation
+Normal rank
@@ Property / cites work @@
+Some observations on the connection between counting and recursion
+Normal rank
@@ Property / cites work @@
+Complete sets and the polynomial-time hierarchy
@@ Property / cites work: Complete sets and the polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+#P-COMPLETENESS VIA MANY-ONE REDUCTIONS
@@ Property / cites work: #P-COMPLETENESS VIA MANY-ONE REDUCTIONS / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2566034