dc.contributor.author |
Downey, R.G |
en |
dc.contributor.author |
Nies, A |
en |
dc.date.accessioned |
2009-04-16T23:15:48Z |
en |
dc.date.available |
2009-04-16T23:15:48Z |
en |
dc.date.issued |
1997-08 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-048 (1997) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3557 |
en |
dc.description.abstract |
We prove that the theory of EXPTIME degrees with respect to
polynomial time Turing and many-one reducibility is undecidable. To
do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in [7]. The method can be applied in fact
to all hyper-polynomial time classes. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
Undecidability Results for Low Complexity Degree Structures |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |