On the structure of linear-time reducibility

Details On the structure of linear-time reducibility On the structure of linear-time reducibility

2006-06-19

arxiv.org/abs/cs/0606080v1

Computer Science

Computational Complexity

10 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the structure of linear-time reducibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the structure of linear-time reducibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the structure of linear-time reducibility will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-304532