L. Longpre. Resource Bounded Kolmogorov Complexity, a Link Between Computational Complexity and Information Theory. PhD thesis, Cornell University, 1986. Technical Report TR-86-776. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
New Bounds for the Language Compression Problem - Buhrman, Laplante, Miltersen (2000) (2 citations) (Correct)
....computer science. A simple counting argument showing that for each length there exist random strings, i.e. strings with no regularity, has had many applications (see [LV97] Early in the history of computational complexity resource bounded notions of Kolmogorov complexity were studied [Har83, Lon90, Lon86]. In particular Sipser [Sip83] introduced a new version of resource bounded Kolmogorov complexity, CD complexity, where one considers the size of the smallest program that accepts the given string and no others. Sipser showed that one can approximate the size of sets using CD complexity with ....
L. Longpre. Resource bounded Kolmogorov complexity, a link between computational complexity and information theory. PhD thesis, Cornell University, 1986. Technical Report TR86776.
New Bounds for the Language Compression Problem - Buhrman, Laplante, Miltersen (2000) (2 citations) (Correct)
....computer science. A simple counting argument showing that for each length there exist random strings, i.e. strings with no regularity, has had many applications (see [LV97] Early in the history of computational complexity resource bounded notions of Kolmogorov complexity were studied [Har83, Lon90, Lon86]. In particular Sipser [Sip83] introduced a new version of resource bounded Kolmogorov complexity, CD complexity, where one considers the size of the smallest program that accepts the given string and no others. Sipser showed that one can approximate the size of sets using CD complexity with ....
L. Longpre. Resource bounded Kolmogorov complexity, a link between computational complexity and information theory. PhD thesis, Cornell University, 1986. Technical Report TR86776.
Almost Everywhere High Nonuniform Complexity - Lutz (1992) (99 citations) (Correct)
.... extraordinary power and scope of this notion have recently been surveyed by Kolmogorov and Uspenskii [19] and Li and Vitanyi [21] In this paper we are primarily concerned with resource bounded Kolmogorov complexities, which have been investigated by Hartmanis [10] Sipser [39] Ko [17] Longpr e [22], Balc azar and Book [3] Huynh [13] Lutz [24] Allender and Watanabe [2] and many others. Martin Lof [29] showed that K(xjn) the conditional Kolmogorov complexity of infinite binary sequences x, exhibits a strong Shannon effect. Specifically, Martin Lof proved that if the series 1 X n=0 2 ....
L. Longpr'e, Resource bounded Kolmogorov complexity, a link between computational complexity and information theory, Ph.D. thesis, Technical Report TR-86-776, Cornell University, 1986.
Symmetry of Information and One-Way Functions - Longpre, Mocas (Correct)
....by Levin [Lev74] and G acs [G ac74] see also [LV88] Using resource bounded Kolmogorov complexity, we address the issue of the validity of symmetry of information in a resource bounded environment. Resource bounded versions of Kolmogorov complexity have recently been studied (see for example [Har83, Sip83, Ko86, Lon86]) For a specific (universal) Turing machine M , time bound T (n) and integer m, define KT (x; T (n) minfl j l = jyj and M(y) x; using at most T (jxj) timeg KT (x j m; T (n) minfl j l = jyj and M(hy; mi) x; using at most T (jxj) timeg S(n) space bounded Kolmogorov complexity KS(x; ....
....only Kolmogorov complex strings, then there are bounds on how secure a pseudo random generator can be. This paper offers a more direct connection between Kolmogorov complexity and one way functions. Some of the results in this paper appeared in a different form in the first author s Ph.D. thesis [Lon86] . 2 Space Bounded Symmetry of Information Theorem 5 [Lon86] Let S(n) n and l(n) be a non decreasing function computable in space S(n) Then to within an additive term of O(log KS(xy j jxyj; S(n) 8x; y such that jyj = l(jxj) KS(xy j jxyj; O(S(n) i KS(x j jxj; O(S(n) KS(y j x; ....
[Article contains additional citation context not shown here]
L. Longpr'e. Resource bounded Kolmogorov complexity, a link between computational complexity and information theory. PhD thesis, Cornell University, 1986. Technical Report TR86-776.
Scaled dimension and the Kolmogorov complexity of.. - Hitchcock.. Self-citation (Kolmogorov) (Correct)
No context found.
L. Longpre. Resource Bounded Kolmogorov Complexity, a Link Between Computational Complexity and Information Theory. PhD thesis, Cornell University, 1986. Technical Report TR-86-776.
Almost Everywhere High Nonuniform Complexity - Lutz (1992) (99 citations) (Correct)
No context found.
L. Longpr'e, Resource bounded Kolmogorov complexity, a link between computational complexity and information theory, Ph.D. thesis, Technical Report TR-86-776, Cornell University, 1986. 38
Communication and Secrecy: Issues in Digital Stenography - Jaynes, Landau (1996) (Correct)
No context found.
L. Longpre, Resource Bounded Kolmogrov Complexity, A Link Between Computational Complexity and Information Theory, PhD Thesis. Dept. of Computer Science. Cornell University, 1986.
Completeness and Weak Completeness under Polynomial-Size Circuits - Juedes, Lutz (1996) (1 citation) (Correct)
No context found.
L. Longpr'e, Resource Bounded Kolmogorov Complexity, a Link Between Computational Complexity and Information Theory, PhD thesis, Cornell University, 1986, Technical Report TR-86-776.
Kolmogorov Complexity, Complexity Cores, and the Distribution.. - Juedes, Lutz (Correct)
No context found.
L. Longpr'e. Resource bounded Kolmogorov complexity, a link between computational complexity and information theory. Ph.D. thesis, Cornell University, 1986. Technical Report TR-86-776.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC