Abstract
We analyze the fine structure of time complexity classes for RAMS, in particular the equivalence relation A = c B (“ A and B have the same time complexity”) ⇔ (for all time constructible f: A ϵ DTIME( f) ⇔ B ϵ DTIME( f)). The = c -equivalence class of A is called its complexity type. Characteristic sequences of time bounds are introduced as a technical tool for the analysis of complexity types. We investigate the relationship between the complexity type of a set and its polynomial time degree, as well as the structure of complexity types inside P with regard to linear time degrees. Furthermore, it is shown that every complexity type contains a sparse set and that the complexity types with their natural partial order form a lattice.
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.
