On the structure of linear-time reducibility
Computational Complexity
2007-05-23 v1
Abstract
In 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.
Keywords
Cite
@article{arxiv.cs/0606080,
title = {On the structure of linear-time reducibility},
author = {Philippe Chapdelaine},
journal= {arXiv preprint arXiv:cs/0606080},
year = {2007}
}
Comments
10 pages