Abstract
The fine structure of time complexity classes for random access machines is analyzed. It is proved that a complexity type C contains sets A,B which are incomparable with respect to polynomial-time reductions if and only if it is not true that C contained in P, and that there is a complexity type C that contains a minimal pair with respect to polynomial-time reductions. The fine structure of P with respect to linear-time reductions is analyzed. It is also shown that every complexity type C contains a sparse set. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
