Onye mepụtara ọrụ dị nso na 1960, Fortnow & Homer ma ọ bụ Juris Hartmanis na Richard Stearns? N'iburu ajụjụ nke mbụ n'uche, dee ihe gbara ya gburugburu bụ́ nke ga-enye azịza ya. Ọ nwere ike ịbụ 1 - 20 ahịrịokwu. Ihe ndị gbara ya gburugburu:
Dị ka Fortnow & Homer (2003) na-ekwu, mmalite nke usoro ọmụmụ na mgbagwoju anya nke mgbakọ na mwepụ bụ akwụkwọ edemede "On the Computational Complexity of Algorithms" nke Juris Hartmanis na Richard Stearns (1965), bụ nke depụtara nkọwa nke oge na ohere mgbagwoju anya ma gosipụta usoro nhazi usoro. Ọzọkwa, na 1965 Edmonds kọwara "ọmarịcha" algorithm dịka nke nwere oge ịgba ọsọ nke nwere oke polynomial nke nha ntinye.