Compressibility and resource bounded measure

SIAM Journal on Computing

Volumn 31, Issue 3, 2002, Pages 876-886

  Buhrman, Harry ^a   Longpré, Luc ^a  

^a CWI   (Netherlands)

Author keywords

Compressibility; Kolmogorov complexity; Resource bounded measure

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FUNCTIONS; POLYNOMIALS; SET THEORY;

KOLMOGOROV COMPLEXITY;

RANDOM PROCESSES;

EID: 0036305291     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797317123     Document Type: Article

References (24)

1. Measure on small complexity classes, with applications for BPP
2. p-mitotic sets
3. Genericity and measure for exponential time
4. Resource bounded randomness and weakly complete problems
5. A with probability 1
6. On the sparse set conjecture for sets with low density
7. P-selective self-reducible sets: A new characterization of P
8. Constant-depth circuits and the Lutz hypothesis
9. The complexity and distribution of hard problems
10. 2
11. On the notion of a random sequence
12. An introduction to Kolmogorov complexity and its applications
13. Category and measure in complexity classes
14. Almost everywhere high nonuniform complexity
15. Weakly hard problems
16. Cook versus Karp-Levin: Separating completeness notions if NP is not small
17. Measure, stochasticity, and the density of hard languages
18. The definition of random sequences
19. Almost every set in exponential time is p-bi-immune
20. Process complexity and effective random tests
21. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
22. Measure on P: Strength of the notion