On the structure of linear-time reducibility

Simple item page
dc.creatorChapdelaine, Philippe
dc.date2006-06-19
dc.date.accessioned2026-07-07T07:13:05Z
dc.date.available2026-07-07T07:13:05Z
dc.descriptionIn 1975, Ladner showed that under the hypothesis that P is not equal to NP, there exists a language which is neither in P, nor NP-complete. This result was latter generalized by Schoning and several authors to various polynomial-time complexity classes. We show here that such results also apply to linear-time reductions on RAMs (resp. Turing machines), and hence allow for separation results in linear-time classes similar to Ladner's ones for polynomial time.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/cs/0606080
dc.identifierhttp://arxiv.org/abs/cs/0606080
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112316
dc.subjectComputational Complexity
dc.subjectF.1.3; F.4.1
dc.titleOn the structure of linear-time reducibility
dc.typetext

Files

Collections

arXiv