Results 1 -
2 of
2
Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory
- Kolmogorov complexity and computational complexity
, 1992
"... This paper presents one method of using time-bounded Kolmogorov complexity as a measure of the complexity of sets, and outlines anumber of applications of this approach to di#erent questions in complexity theory. Connections will be drawn among the following topics: NE predicates, ranking functi ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
This paper presents one method of using time-bounded Kolmogorov complexity as a measure of the complexity of sets, and outlines anumber of applications of this approach to di#erent questions in complexity theory. Connections will be drawn among the following topics: NE predicates, ranking functions, pseudorandom generators, and hierarchy theorems in circuit complexity.
Limitations of the Upward Separation Technique
, 1990
"... this paper was presented at the 16th International Colloquium on Automata, Languages, and Programming [3] ..."
Abstract
-
Cited by 16 (0 self)
- Add to MetaCart
this paper was presented at the 16th International Colloquium on Automata, Languages, and Programming [3]
