Hostname: page-component-6bf8c574d5-956mj Total loading time: 0 Render date: 2025-02-20T12:32:30.369Z Has data issue: false hasContentIssue false
  • English
  • Français

Yu. V. Matiyasevich. Desyataya problema Gil'berta. Russian original of the preceding. Matematicheskaya logika i osnovaniya matematiki. VO “Nauka,” Moscow1993, 223 pp. - Christos H. Papadimitriou. Computational complexity. Addison-Wesley Publishing Company, Reading, Mass., etc., 1994, xv + 523 pp.

Review products

Yu. V. Matiyasevich. Desyataya problema Gil'berta. Russian original of the preceding. Matematicheskaya logika i osnovaniya matematiki. VO “Nauka,” Moscow1993, 223 pp.
Christos H. Papadimitriou. Computational complexity. Addison-Wesley Publishing Company, Reading, Mass., etc., 1994, xv + 523 pp.

Published online by Cambridge University Press:  12 March 2014

Neil Immerman
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 62 , Issue 2 , June 1997 , pp. 677 - 678
Copyright
Copyright © Association for Symbolic Logic 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)