Home›Theory of Computation›Field›Computational Complexity Theory›All Computational Complexity TheoryBrowse ByAll Computational Complexity TheoryFactsAll Computational Complexity TheorySourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1965 1All Computational Complexity TheoryFilter Results58 entriesBornAll1903 (1)1921 (1)1928 (1)1931 (1)1932 (2)1935 (1)1936 (2)1939 (1)1942 (1)1943 (2)1945 (2)1946 (2)1947 (2)1948 (3)1949 (1)1950 (2)1952 (1)1953 (1)1955 (1)1956 (2)1957 (1)1959 (1)1960 (2)1961 (2)1962 (1)1963 (3)1966 (2)1968 (1)1974 (1)1975 (1)1981 (2)GroupAllComputational Complexity Theory (58)NationalityAllChina (2)Greece (1)India (3)Poland (1)United States (7)BrowseCompareSelect all 58Alexander RazborovTheory of ComputationAndrew Chi-Chih YaoTheory of ComputationAndrew V. GoldbergTheory of ComputationAndrew YaoTheory of ComputationAndrey Nikolaevich KolmogorovTheory of ComputationAnne CondonTheory of ComputationBoaz BarakTheory of ComputationBoris TrakhtenbrotTheory of ComputationChristos PapadimitriouTheory of ComputationConstantinos DaskalakisTheory of ComputationDavid S. JohnsonTheory of ComputationElias KoutsoupiasTheory of ComputationEric AllenderTheory of ComputationEugene LuksTheory of ComputationEun Jung KimTheory of ComputationGary MillerTheory of ComputationGregory ChaitinTheory of ComputationIngo WegenerTheory of ComputationJin-Yi CaiTheory of ComputationJohan HastadTheory of ComputationJoseph F. TraubTheory of ComputationJuris HartmanisTheory of ComputationLance FortnowTheory of ComputationLarry StockmeyerTheory of ComputationLaszlo BabaiTheory of ComputationLaszlo LovaszTheory of ComputationLeonid KhachiyanTheory of ComputationLeonid LevinTheory of ComputationMadhu SudanTheory of ComputationManindra AgrawalTheory of ComputationMarek KarpinskiTheory of ComputationMario SzegedyTheory of ComputationMichael GareyTheory of ComputationMichael O. RabinTheory of ComputationMihalis YannakakisTheory of ComputationMike PatersonTheory of ComputationMing LiTheory of ComputationNarendra KarmarkarTheory of ComputationNeeraj KayalTheory of ComputationNitin SaxenaTheory of ComputationOleg LupanovTheory of ComputationPaul SpirakisTheory of ComputationPaul VitanyiTheory of ComputationPhokion G. KolaitisTheory of ComputationRaghu MekaTheory of ComputationRajeev MotwaniTheory of ComputationRichard E. LadnerTheory of ComputationRichard E. StearnsTheory of ComputationRichard M. KarpTheory of ComputationRod DowneyTheory of ComputationSanjeev AroraTheory of ComputationSeinosuke TodaTheory of ComputationShmuel WinogradTheory of ComputationStathis ZachosTheory of ComputationStephen CookTheory of ComputationSteven RudichTheory of ComputationTim RoughgardenTheory of ComputationWalter SavitchTheory of ComputationSources1. Wikipedia: Computational complexity theorytier 2WikipediaComputational complexity theory, History section, Hartmanis-Stearns sentenceQuote, Computational complexity theory, History section, Hartmanis-Stearns sentenceThe beginning of systematic studies in computational complexity is attributed to the seminal 1965 paper "On the Computational Complexity of Algorithms" by Juris Hartmanis and Richard E. Stearns, which laid out the definitions of time complexity and space complexity, and proved the hierarchy theorems.View the SourceComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.Reader Challenges (0)No disputes yet. Spotted an error or a better source? Open the first one.Sign in to dispute this or suggest a correction.