Skip to main content
SpringerLink
Log in

On Universally Polynomial Context-Free Languages

  • Conference paper
  • First Online:
Book cover Computing and Combinatorics (COCOON 2001)

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

Included in the following conference series:

Abstract

A language is universally polynomial if its intersection with every NP-complete language is in P. Such a language would provide an automatic method for generating easy instances of intractable problems. In this note, we give a complete characterization of universally polynomial languages that are context-free, answering an open question in [4].

This research is partially supported by an SCU-IBM Faculty Research Grant.

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. Balcézar, J.L., Díaz, J., and Gabarró, J. Structural Complexity I, vol. 11 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.

    Google Scholar 

  2. Berman, L., and Hartmanis, J. On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6 (1977), 305–322.

    Article  MATH  MathSciNet  Google Scholar 

  3. Bodlaender, H.L., Kloks, T., Tan, R.B., AND van Leeuwen, J. λ-coloring of graphs. In Proceedings of the 17thAnnual Symposium on Theoretical Aspects of Computer Science (2000), pp. 395–406.

    Google Scholar 

  4. Demaine, E.D., Lopez-Ortiz, A., AND Munro, J.I. On universally easy classes for NP-complete problems. In Proceedings of the 12thAnnual ACM-SIAM Symposium on Discrete Algorithms (2001), pp. 910–911.

    Google Scholar 

  5. Garey, M.R., AND Johnson, D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.

    Google Scholar 

  6. Hopcroft, J., AND Ullman, J. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979.

    MATH  Google Scholar 

  7. Ibarra, O., AND Ravikumar, B. On sparseness, ambiguity and other decision problems for acceptors and transducers. In Proceedings of the 3rd Annual Symposium on Theoretical Aspects of Computer Science (1986), pp. 171–179.

    Google Scholar 

  8. Latteux, M., AND Thierrrin, G. On bounded context-free languages. Elektron. Informtionsverarb. Kybernet. 20 (1984), 3–8.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics & Computer Science, Santa Clara University, Santa Clara, CA, 95054-0290, USA

    Nicholas Tran

Authors
  1. Nicholas Tran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Massachusetts, One University Avenue, Lowell, MA, 01854, USA

    Jie Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tran, N. (2001). On Universally Polynomial Context-Free Languages. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-44679-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42494-9

  • Online ISBN: 978-3-540-44679-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation