Skip to main content
SpringerLink
Log in

Space-Efficient Informational Redundancy

  • Conference paper
Algorithms and Computation (ISAAC 2008)

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

Included in the following conference series:

  • 1490 Accesses

Abstract

We study the relation of autoreducibility and mitoticity for polylog-space many-one reductions and log-space many-one reductions. For polylog-space these notions coincide, while proving the same for log-space is out of reach. More precisely, we show the following results with respect to nontrivial sets and many-one reductions.

  1. 1

    polylog-space autoreducible \({\,\mathop{\Leftrightarrow}\,}\) polylog-space mitotic

  2. 1

    log-space mitotic log-space autoreducible (logn ·loglogn)-space mitotic

  3. 1

    relative to an oracle, log-space autoreducible log-space mitotic

The oracle is an infinite family of graphs whose construction combines arguments from Ramsey theory and Kolmogorov complexity.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Ambos-Spies, K.: P-mitotic sets. In: Börger, E., Rödding, D., Hasenjaeger, G. (eds.) Rekursive Kombinatorik 1983. LNCS, vol. 171, pp. 1–23. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  2. Buss, J.F.: Relativized alternation and space-bounded computation. Journal of Computer and System Sciences 36(3), 351–378 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control 70(1), 32–53 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. Glaßer, C., Pavan, A., Selman, A.L., Zhang, L.: Redundancy in complete sets. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 444–454. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Glaßer, C., Selman, A.L., Travers, S., Zhang, L.: Non-mitotic sets. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 146–157. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Gottlob, G.: Collapsing oracle-tape hierarchies. In: Proceedings 11th Conference on Computational Complexity, pp. 33–42. IEEE Computer Society Press, Los Alamitos (1996)

    Google Scholar 

  7. Lachlan, A.H.: The priority method I. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 13, 1–10 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ladner, R.E.: A completely mitotic nonrecursive r.e. degree. Trans. American Mathematical Society 184, 479–507 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ladner, R.E.: Mitotic recursively enumerable sets. Journal of Symbolic Logic 38(2), 199–211 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ladner, R.E., Lynch, N.A.: Relativization of questions about log space computability. Mathematical Systems Theory 10, 19–32 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lynch, N.A.: Log space machines with multiple oracle tapes. Theoretical Computer Science 6, 25–39 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ruzzo, W.L., Simon, J., Tompa, M.: Space-bounded hierarchies and probabilistic computations. Journal of Computer and System Sciences 28(2), 216–230 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  13. Trakhtenbrot, B.: On autoreducibility. Dokl. Akad. Nauk SSSR 192(6), 1224–1227 (1970); Translation in Soviet Math. Dokl. 11(3), 814–817 (1970)

    MathSciNet  Google Scholar 

  14. Wilson, C.B.: A measure of relativized space which is faithful with respect to depth. Journal of Computer and System Sciences 36(3), 303–312 (1988)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University at Würzburg, Germany

    Christian Glaßer

Authors
  1. Christian Glaßer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technologies, University of Sydney, Australia

    Seok-Hee Hong

  2. Graduate School of Informatics, Kyoto University, 606-8501, Kyoto, Japan

    Hiroshi Nagamochi

  3. Graduate School of Informatics, Kyoto University, Japan

    Takuro Fukunaga

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Glaßer, C. (2008). Space-Efficient Informational Redundancy. In: Hong, SH., Nagamochi, H., Fukunaga, T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92182-0_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92182-0_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92181-3

  • Online ISBN: 978-3-540-92182-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation