Ko wai i whakaputa i tētahi mahi tata atu ki te 1995, Fortnow & Homer, Juris Hartmanis me Richard Stearns rānei? I runga i te pātai o mua, tuhia he horopaki kei roto te whakautu. Ka taea te 1 - 20 rerenga kōrero. Te horopaki:
E ai ki a Fortnow & Homer (2003), ko te tīmatanga o ngā akoranga ā-pūnaha i roto i te matatini ā-rorohiko e whakawhiwhia ana ki te pepa matua "On the Computational Complexity of Algorithms" na Juris Hartmanis rāua ko Richard Stearns (1965), nāna i whakatakoto ngā whakamāramatanga o te wā me te matatini ā-rohe, ā, i whakamatau i ngā kaupapa rangatōpū. Waihoki, i te tau 1965, i tautuhia e Edmonds he hātepe "pai" hei kotahi me te wa rere e herea ana e te polynomial o te rahi whakauru.