On optimal language compression for sets in PSPACE/poly (Q2354585): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00224-014-9535-y / rank | |||
Property / author | |||
Property / author: Marius Zimand / rank | |||
Property / author | |||
Property / author: Marius Zimand / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2092912590 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1304.1005 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compression of samplable sources / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resource-Bounded Kolmogorov Complexity Revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resource bounded symmetry of information revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Language compression and pseudorandom generators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Short lists with short programs in short time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4745752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4526985 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On symmetry of information and polynomial time invertibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4788614 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hardness vs randomness / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00224-014-9535-Y / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:12, 18 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On optimal language compression for sets in PSPACE/poly |
scientific article |
Statements
On optimal language compression for sets in PSPACE/poly (English)
0 references
20 July 2015
0 references
compression
0 references
time-bounded Kolmogorov complexity
0 references
pseudo-random generator
0 references
0 references