47
Views
2
CrossRef citations to date
0
Altmetric
Miscellany

Proving completeness by logic

Pages 151-161 | Accepted 28 Apr 2004, Published online: 25 Jan 2007

References

References

  • Fagin R 1974 Generalized first-order spectra and polynomial-time recognizable sets In: R.M. Karp (Ed.) Complexity of Computations, American Mathematics Society pp. 43–73
  • Orponen P Mannila H 1987 On approximation preserving reductions: complete problems and robust measures Technical Report C-1987-28, Dept. of Computer Science, University of Helsinki Finland
  • Cook SA 1971 The complexity of theorem-proving procedures In: Proc. STOC’71 pp. 151–158
  • Immerman N 1998 Descriptive Complexity, Springer-Verlag
  • Papadimitriou , CH and Yannakakis , M . 1991 . Optimization, approximation and complexity classes . Journal of Computer and System Sciences , 43 : 425 – 440 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.