On the Optimal Compression of Sets in PSPACE (Q3088270): Difference between revisions

@@ Property / arXiv ID @@
+.2816
@@ Property / arXiv ID: 1104.2816 / rank @@
+Normal rank
@@ Property / cites work @@
+Low-depth witnesses are easy to find
@@ Property / cites work: Low-depth witnesses are easy to find / rank @@
+Normal rank
@@ Property / cites work @@
+Q4287354
@@ Property / cites work: Q4287354 / rank @@
+Normal rank
@@ Property / cites work @@
+Resource-Bounded Kolmogorov Complexity Revisited
@@ Property / cites work: Resource-Bounded Kolmogorov Complexity Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Language compression and pseudorandom generators
@@ Property / cites work: Language compression and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
+Normal rank
@@ Property / cites work @@
+Kolmogorov Complexity in Randomness Extraction.
@@ Property / cites work: Kolmogorov Complexity in Randomness Extraction. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526985
@@ Property / cites work: Q4526985 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Resource bounded symmetry of information revisited
+Normal rank
@@ Property / cites work @@
+Q4788614
@@ Property / cites work: Q4788614 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Randomness Buys Depth for Approximate Counting
@@ Property / cites work: Randomness Buys Depth for Approximate Counting / rank @@
+Normal rank