The enumerability and invariance of complexity classes*
Under an Elsevier user license
open archive
Cited by (0)
- *
Much of this work was done while the author was at Cornell University. Some of these results were first announced at the Second Annual Symposium on the Theory of Computing in May 1970 at Northampton, Mass. An expanded version appears in the author's thesis [10]. This research has been supported in part by National Science Foundation grants GJ-155 and GJ-579.
Copyright © 1971 Published by Elsevier Inc.