The complexity of estimating min-entropy (Q260395): Difference between revisions

@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Cryptography in constant parallel time
@@ Property / cites work: Cryptography in constant parallel time / rank @@
+Normal rank
@@ Property / cites work @@
+On pseudorandomness and resource-bounded measure
@@ Property / cites work: On pseudorandomness and resource-bounded measure / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Estimating MCMC Convergence Time
+Normal rank
@@ Property / cites work @@
+The Complexity of Distinguishing Markov Random Fields
+Normal rank
@@ Property / cites work @@
+Error-bounded probabilistic computations between MA and AM
+Normal rank
@@ Property / cites work @@
+Extractors and Lower Bounds for Locally Samplable Sources
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+Normal rank
@@ Property / cites work @@
+Interactive proofs and the hardness of approximating cliques
+Normal rank
@@ Property / cites work @@
+On the complexity of succinct zero-sum games
@@ Property / cites work: On the complexity of succinct zero-sum games / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941874
@@ Property / cites work: Q4941874 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Deterministic extractors for small-space sources
@@ Property / cites work: Deterministic extractors for small-space sources / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Q2941639
@@ Property / cites work: Q2941639 / rank @@
+Normal rank
@@ Property / cites work @@
+The consensus string problem and the complexity of comparing hidden Markov models.
+Normal rank
@@ Property / cites work @@
+Derandomizing Arthur-Merlin games using hitting sets
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating the VC dimension.
+Normal rank
@@ Property / cites work @@
+Q4843187
@@ Property / cites work: Q4843187 / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandomness for approximate counting and sampling
+Normal rank
@@ Property / cites work @@
+Q3135094
@@ Property / cites work: Q3135094 / 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 @@
+Compression of samplable sources
@@ Property / cites work: Compression of samplable sources / rank @@
+Normal rank
@@ Property / cites work @@
+A study of statistical zero-knowledge proofs (to appear)
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Extractors for Circuit Sources
@@ Property / cites work: Extractors for Circuit Sources / rank @@
+Normal rank