Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-29T01:20:24.589Z Has data issue: false hasContentIssue false
  • English
  • Français

F. D. Lewis. The enumerability and invariance of complexity classes. Journal of computer and system sciences, vol. 5 (1971), pp. 286–303.

Published online by Cambridge University Press:  12 March 2014

Nancy A. Lynch
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 39 , Issue 2 , June 1974 , pp. 349
Copyright
Copyright © Association for Symbolic Logic 1974

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.)