Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 1990: Graph-Theoretic Concepts in Computer Science pp 276–290Cite as

Comparing the expressibility of two languages formed using NP-complete graph operators

  • Graphs, Languages And Databases
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. FAGIN, Generalized first-order spectra and polynomial-time recognizable sets, Complexity of Computation (Ed. R.Karp), SIAMAMS Proc., Vol. 7, 1974, pp.27–41.

    Google Scholar 

  2. M.R. GAREY & D.S. JOHNSON, Computers and intractability, W.H.Freeman and Co., San Francisco, 1979.

    Google Scholar 

  3. Y. GUREVICH, Toward logic tailored for computational complexity, Computation and Proof Theory (Ed. E. Börger et al.), Lecture Notes in Mathematics 1104, Springer-Verlag, Berlin, 1984, pp.175–216.

    Google Scholar 

  4. Y.GUREVICH, Logic and the challenge of computer science, Univ. Michigan Tech. Rep., CRL-TR-10-85, Sept. 1985.

    Google Scholar 

  5. N. IMMERMAN, Languages that capture complexity classes, SIAM J. Comput., Vol. 16, No. 4, 1987, pp.760–778.

    Google Scholar 

  6. I.A.STEWART, Logical and schematic characterization of complexity classes, Univ. Newcastle upon Tyne Tech. Rep., No. 290, 1989: submitted for publication.

    Google Scholar 

  7. I.A.STEWART, Using the Hamiltonian path operator to capture NP, Univ. Newcastle upon Tyne Tech. Rep., 1990: to appear in Proc. 2nd International Conference on Computing and Information, Niagara Falls, Canada, May, 1989, Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  8. I.A.STEWART, Comparing the expressibility of languages formed using NP-complete operators, Univ. Newcastle upon Tyne Tech. Rep., 1990.

    Google Scholar 

  9. L.J. STOCKMEYER, The polynomial-time hierarchy, Theor. Comp. Sci., Vol. 3, 1977, pp.1–22.

    Google Scholar 

  10. S. SKYUM & L.G. VALIANT, A complexity theory based on Boolean algebra, J. Assoc. Comput. Mach., Vol. 32, 1985, pp.484–502.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Newcastle upon Tyne, Claremont Road, NE1 7RU, Newcastle upon Tyne, England

    Iain A. Stewart

Authors
  1. Iain A. Stewart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf H. Möhring

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stewart, I.A. (1991). Comparing the expressibility of two languages formed using NP-complete graph operators. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-53832-1_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53832-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation