Ndiani akabudisa basa riri pedyo na1995, Fortnow naHomer kana kuti Juris Hartmanis naRichard Stearns? Tichifunga nezvemubvunzo wapfuura, nyora mashoko akapoteredza mhinduro yacho. Inogona kuva mitsara 1 - 20. Mashoko akapoteredza:
Sezvo Fortnow & Homer (2003) vachitaura, kutanga kwezvidzidzo zvakarongeka mukunetsa kwemasvomhu kunonzi kune pepa rekutanga "On the Computational Complexity of Algorithms" naJuris Hartmanis naRichard Stearns (1965), iyo yakaratidza tsanangudzo yenguva uye nzvimbo yakaoma uye yakaratidza hierarchy theorems. Uyewo, muna 1965 Edmonds akarondedzera "yakanaka" algorithm seimwe ine nguva yekumhanya yakaganhurirwa ne polynomial yehukuru hwekupinda.