On the Complexity of Computational Problems Regarding Distributions (Q3088193): Difference between revisions

@@ Property / cites work @@
+Statistical zero-knowledge languages can be recognized in two rounds
+Normal rank
@@ Property / cites work @@
+Q4783716
@@ Property / cites work: Q4783716 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of approximating entropy
@@ Property / cites work: The complexity of approximating entropy / rank @@
+Normal rank
@@ Property / cites work @@
+Free Bits, PCPs, and Nonapproximability---Towards Tight Results
+Normal rank
@@ Property / cites work @@
+Universal classes of hash functions
@@ Property / cites work: Universal classes of hash functions / rank @@
+Normal rank
@@ Property / cites work @@
+Spot-checkers
@@ Property / cites work: Spot-checkers / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
+Normal rank
@@ Property / cites work @@
+Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
+Normal rank
@@ Property / cites work @@
+Q4542558
@@ Property / cites work: Q4542558 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941874
@@ Property / cites work: Q4941874 / rank @@
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+Q4228522
@@ Property / cites work: Q4228522 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+The Wire-Tap Channel
@@ Property / cites work: The Wire-Tap Channel / rank @@
+Normal rank