Skip to main content
SpringerLink
Log in

Resolution of Hartmanis' conjecture for NL-hard sparse sets

  • Session 3: Complexity
  • Conference paper
  • First Online:
Book cover Computing and Combinatorics (COCOON 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1276))

Included in the following conference series:

Abstract

We resolve a conjecture of Hartmanis from 1978 about sparse hard sets for nondeterministic logspace (NL). We show that there exists a sparse hard set S for NL under logspace many-one reductions if and only if NL = L (deterministic logspace).

Research supported in part by NSF grants CCR-9057486 and CCR-9319093, and by an Alfred P. Sloan Fellowship.

Most of this research was done while the author was at SUNY/Buffalo, supported in part by NSF grant CCR-9409104.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing, 6:305–321, 1977. A preliminary version appeared in STOL 1976.

    Google Scholar 

  2. A. Borodin, J. von zur Gathen, and J. Hopcroft. Fast parallel matrix and GCD computations. Information and Control, 52:241–256, 1982.

    Google Scholar 

  3. J. Cai, A. Naik, and D. Sivakumar. On the existence of hard sparse sets under weak reductions. In the proceedings of The 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 1996, 307–318.

    Google Scholar 

  4. J. Cai and M. Ogihara. Sparse sets versus complexity classes. UBCS-TR 95-41, Computer Science Dept., University at Buffalo, September 1995.

    Google Scholar 

  5. J. Cai and D. Sivakumar. The resolution of a Hartmanis conjecture. In Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, pages 362–373, 1995.

    Google Scholar 

  6. W. Eberly. Very fast parallel polynomial arithmetic. SIAM J. Computing 18(5):205–217, 1989.

    Google Scholar 

  7. J. Hartmanis. On log-tape isomorphisms of complete sets. Theoretical Computer Science, 7(3):273–286, 1978.

    Google Scholar 

  8. L. Hemachandra, M. Oghara, and S. Toda.Space-efficient recognition of sparse self-reducible languages.Computational Complexity, 4:262–296, 1994.

    Google Scholar 

  9. L. Hemachandra, M. Ogihara, and O. Watanabe. How hard are sparse sets. In Proc. 7th Annual IEEE Conference on Structure in Complexity Theory, pages 222–238, 1992.

    Google Scholar 

  10. N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760–778, 1987.

    Google Scholar 

  11. N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17:935–938, 1988.

    Google Scholar 

  12. R. Karp and R. Lipton. Turing machines that take advice. L'enseignement Mathematique, 28(3/4):191–209, 1982.

    Google Scholar 

  13. S. Mahaney. Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis. J. Comput. System Sci., 25(2):130–143, 1982.

    Google Scholar 

  14. D. Van Melkebeek. On reductions of P sets to sparse sets. TR 95-06, Computer Science Dept., The University of Chicago, 1995.

    Google Scholar 

  15. M. Ogihara. Sparse hard sets for P yield space-efficient algorithms. In Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, pages 354–361, 1995.

    Google Scholar 

  16. F. Preparata. Inverting a Vandermonde matrix in minimum parallel time. Information Processing Letters, 38:291–294, 1991.

    Google Scholar 

  17. R. Soare. Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets. Springer Verlag, 1987.

    Google Scholar 

  18. W. Savitch. Maze recognizing automata and nondeterministic tape complexity. J. Comp. Sys. Sci., 7:389–403, 1973.

    Google Scholar 

  19. R. Szelepcsényi. The method of forcing for nondeterministic automata. Bull. of the EATCS, 33:96–100, 1987.

    Google Scholar 

  20. J.H. van Lint. Introduction to Coding Theory. Springer-Verlag, 1991.

    Google Scholar 

  21. L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85–93, 1986.

    Google Scholar 

  22. P. Young. How reductions to sparse sets collapse the polynomial-time hierarchy: A primer (Part I). SIGACT News, 23(3):107–117, 1992.

    Google Scholar 

  23. P. Young. How reductions to sparse sets collapse the polynomial-time hierarchy: A primer (Part II). SIGACT News, 23(4):83–94, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York, 14260, Buffalo, NY, USA

    Jin-Yi Cai

  2. Department of Computer Science, University of Houston, 77204, Houston, TX, USA

    D. Sivakumar

Authors
  1. Jin-Yi Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Sivakumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, JY., Sivakumar, D. (1997). Resolution of Hartmanis' conjecture for NL-hard sparse sets. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045073

Download citation

  • DOI: https://doi.org/10.1007/BFb0045073

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation