Searching for "Polynomial-Time Compression." – sorted by Relevance.
-
Dimension is compression
- -bounded compression for finite strings. We completely characterize polynomial-time dimension in terms of polynomial-time
- Cited by 11 (5 self) – Add To MetaCart
-
A PTIME-complete matching problem for SLP-compressed words
- is complete for polynomial-time. Key words: Algorithms, pattern-matching, compressed strings, complexity. 1
- Add To MetaCart
-
Compression of samplable sources
- ). For explicit (i.e. polynomial-time) compression and decompression algorithms, this bound cannot be achieved
- Cited by 2 (1 self) – Add To MetaCart
-
Resolution Cannot Polynomially Simulate Compressed-BFS
- that the recently reported Compressed-BFS algorithm [4] empirically solves pigeonhole instances in polynomial time
- Cited by 4 (0 self) – Add To MetaCart
-
On everlasting security in the hybrid bounded storage model
- and throughout the broadcast Charlie runs a polynomial time algorithm We call this the compression algorithm
- Cited by 2 (1 self) – Add To MetaCart
-
Effective Fractal Dimension in Algorithmic Information Theory
- compressibility characterization of polynomial-time dimension has been obtained in [41] via polynomial-time
- Cited by 1 (1 self) – Add To MetaCart

