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

  • Iain A. Stewart
Graphs, Languages And Databases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 484)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [2]
    M.R. GAREY & D.S. JOHNSON, Computers and intractability, W.H.Freeman and Co., San Francisco, 1979.Google Scholar
  3. [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. [4]
    Y.GUREVICH, Logic and the challenge of computer science, Univ. Michigan Tech. Rep., CRL-TR-10-85, Sept. 1985.Google Scholar
  5. [5]
    N. IMMERMAN, Languages that capture complexity classes, SIAM J. Comput., Vol. 16, No. 4, 1987, pp.760–778.Google Scholar
  6. [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. [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. [8]
    I.A.STEWART, Comparing the expressibility of languages formed using NP-complete operators, Univ. Newcastle upon Tyne Tech. Rep., 1990.Google Scholar
  9. [9]
    L.J. STOCKMEYER, The polynomial-time hierarchy, Theor. Comp. Sci., Vol. 3, 1977, pp.1–22.Google Scholar
  10. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Iain A. Stewart
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneNewcastle upon TyneEngland

Personalised recommendations