Enumerative counting is hard (Q1822963): Difference between revisions

@@ Property / cites work @@
+Polynomial terse sets
@@ Property / cites work: Polynomial terse sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3747725
@@ Property / cites work: Q3747725 / rank @@
+Normal rank
@@ Property / cites work @@
+On counting problems and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Random oracles separate PSPACE from the polynomial-time 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 @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Probabilistic Turing Machines
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Q4743737
@@ Property / cites work: Q4743737 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Presburger arithmetic with fixed quantifier dimension
+Normal rank
@@ Property / cites work @@
+Q4139697
@@ Property / cites work: Q4139697 / rank @@
+Normal rank
@@ Property / cites work @@
+On Approximation Algorithms for # P
@@ Property / cites work: On Approximation Algorithms for # P / 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 @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Some observations on the connection between counting and recursion
+Normal rank