Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2001: Mathematical Foundations of Computer Science 2001 pp 285–291Cite as

There Are No Sparse NPw-Hard Sets

  • Conference paper
  • First Online:

  • 852 Accesses

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

Abstract

In this paper we prove that, in the context of weak machines over ℝ, there are no sparse NP-hard sets.

Partially supported by CERG grant 9040393.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. In K. Ambos-Spies, S. Homer, and U. Schöning, editors, Complexity Theory: current research, pages 1–45. Cambridge University Press, 1993.

    Google Scholar 

  2. L. Berman and J. Hartmanis. On isomorphism and density of NP and other complete sets. SIAM Journal on Computing, 6:305–322, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  3. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, 1998.

    Google Scholar 

  4. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the Amer. Math. Soc., 21:1–46, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Bochnak, M. Coste, and M.-F. Roy. Géométrie algébrique réelle. Springer-Verlag, 1987.

    Google Scholar 

  6. F. Cucker, P. Koiran, and M. Matamala. Complexity and dimension. Information Processing Letters, 62:209–212, 1997.

    Article  MathSciNet  Google Scholar 

  7. F. Cucker, M. Shub, and S. Smale. Complexity separations in Koiran’s weak model. Theoretical Computer Science, 133:3–14, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  8. H. Fournier. Sparse NP-complete problems over the reals with addition. Theoretical Computer Science, 255:607–610, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. Fournier and P. Koiran. Lower bounds are not easier over the reals: Inside PH. In 28th International Colloquium on Automata, Languages and Programming, volume 1853 of Lect. Notes in Comp. Sci., pages 832–843. Springer-Verlag, 2000.

    Google Scholar 

  10. P. Koiran. A weak version of the Blum, Shub & Smale model. J. Comput. System Sci., 54:177–189, 1997. A preliminary version appeared in 34th annual IEEE Symp. on Foundations of Computer Science, pp. 486-495, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  11. S. R. Mahaney. Sparse complete sets for NP: Solution of a conjecture by Berman and Hartmanis. J. Comput. System Sci., 25:130–143, 1982.

    Google Scholar 

  12. K. Meer. A note onaP≠ NP result for a restricted class of real machines. Journal of Complexity, 8:451–453, 1992.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Hong Kong, P. R. of China

    Felipe Cucker

  2. IMR, Université de Rennes I, Campus de Beaulieu, Rennes, 35042, France

    Dima Grigoriev

Authors
  1. Felipe Cucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dima Grigoriev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cucker, F., Grigoriev, D. (2001). There Are No Sparse NPw-Hard Sets. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44683-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation