On optimal language compression for sets in PSPACE/poly (Q2354585): Difference between revisions

@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Compression of samplable sources
@@ Property / cites work: Compression of samplable sources / 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 @@
+Resource bounded symmetry of information revisited
+Normal rank
@@ Property / cites work @@
+Language compression and pseudorandom generators
@@ Property / cites work: Language compression and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+Short lists with short programs in short time
@@ Property / cites work: Short lists with short programs in short time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4745752
@@ Property / cites work: Q4745752 / 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 @@
+An introduction to Kolmogorov complexity and its applications
+Normal rank
@@ Property / cites work @@
+On symmetry of information and polynomial time invertibility
+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