Skip to main content
SpringerLink
Log in

Space-Bounded Kolmogorov Extractors

  • Conference paper
Book cover Computer Science – Theory and Applications (CSR 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7353))

Included in the following conference series:

Abstract

An extractor is a function that receives some randomness and either “improves” it or produces “new” randomness. There are statistical and algorithmical specifications of this notion. We study an algorithmical one called Kolmogorov extractors and modify it to resource-bounded version of Kolmogorov complexity. Following Zimand we prove the existence of such objects with certain parameters. The utilized technique is “naive” derandomization: we replace random constructions employed by Zimand by pseudo-random ones obtained by Nisan-Wigderson generator.

Supported by ANR Sycomore, NAFIT ANR-08-EMER-008-01 and RFBR 09-01-00709-a grants.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai, M.: Approximate counting with uniform constant-depth circuits. In: Advances in Computational Complexity Theory, pp. 1–20. American Mathematical Society, Providence (1993)

    Google Scholar 

  2. Fortnow, L., Hitchcock, J., Pavan, A., Vinodchandran, N.V., Wang, F.: Extracting Kolmogorov complexity with applications to dimension zero-one laws. Information and Computation 209(4), 627–636 (2011); Preliminary version appeared in Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming. LNCS, vol. 4051, pp. 335–345 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hitchcock, J., Pavan, A., Vinodchandran, N.: Kolmogorov complexity in randomness extraction. Electronic Colloquium on Computational Complexity (ECCC) 16, 71 (2009)

    Google Scholar 

  4. Musatov, D.: Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol. 6651, pp. 64–76. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Nisan, N., Wigderson, A.: Hardness vs. Randomness. Journal of Computer and System Sciences 49(2), 149–167 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Romashchenko, A.: Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol. 6651, pp. 50–63. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Shaltiel, R.: An Introduction to Randomness Extractors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 21–41. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Viola, E.: Randomness buys depth for approximate counting. In: Proceedings of IEEE FOCS 2011, pp. 230–239 (2011)

    Google Scholar 

  9. Zimand, M.: Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 326–338. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Zimand, M.: Extracting the Kolmogorov complexity of strings and sequences from sources with limited independence. In: Proceedings 26th STACS, pp. 697–708 (2009)

    Google Scholar 

  11. Zimand, M.: Impossibility of Independence Amplification in Kolmogorov Complexity Theory. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 701–712. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Zimand, M.: Possibilities and impossibilities in Kolmogorov complexity extraction. Sigact News 41(4), 74–94 (2010)

    MathSciNet  Google Scholar 

  13. Zimand, M.: Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors. In: Proceedings of 26th IEEE Conference in Computational Complexity, pp. 148–156 (2011)

    Google Scholar 

  14. Zimand, M.: On the Optimal Compression of Sets in PSPACE. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 65–77. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow Institute for Physics and Technology, Russia

    Daniil Musatov

  2. Branch for Theoretical and Applied Research, Yandex LLC, Russia

    Daniil Musatov

Authors
  1. Daniil Musatov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Steklov Institute of Mathematics at St.Petersburg, 191023, St. Petersburg, Russia

    Edward A. Hirsch

  2. University of Turku, 20014, Turku, Finland

    Juhani Karhumäki  & Arto Lepistö  & 

  3. Lobachevky State University of Nizhni Novgorod, 603950, Niszhi Novgorod, Russia

    Michail Prilutskii

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Musatov, D. (2012). Space-Bounded Kolmogorov Extractors. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds) Computer Science – Theory and Applications. CSR 2012. Lecture Notes in Computer Science, vol 7353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30642-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30642-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30641-9

  • Online ISBN: 978-3-642-30642-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation