On the hardness of computing the permanent of random matrices (Q1355377): Difference between revisions

@@ Property / cites work @@
+Some connections between bounded query classes and non-uniform complexity.
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+Does co-NP have short interactive proofs ?
@@ Property / cites work: Does co-NP have short interactive proofs ? / rank @@
+Normal rank
@@ Property / cites work @@
+A note on enumerative counting
@@ Property / cites work: A note on enumerative counting / rank @@
+Normal rank
@@ Property / cites work @@
+Highly resilient correctors for polynomials
@@ Property / cites work: Highly resilient correctors for polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+Algebraic methods for interactive proof systems
@@ Property / cites work: Algebraic methods for interactive proof systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Probabilistic Algorithms for Verification of Polynomial Identities
+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 @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank