 | This is the talk page of a redirect that targets the page: • Time complexity Because this page is not frequently watched, present and future discussions, edit requests and requested moves should take place at: • Talk:Time complexity |
Untitled
editI think there's value in explicitly clarifying that polynomial time is usually considered solvable and exponential time is not (although I revised my original paragraph slightly to soften the generalization since large polynomials can take too long for many apps). -- Bilbo1507 18:26, 22 January 2007 (UTC)
Does everyone think that my simplication (the parentheses with the i.e) is sufficiently accurate? Cool3 22:16, 1 March 2006 (UTC)
- Ya, looks good. -- Bilbo1507 18:26, 22 January 2007 (UTC)
I think someone should replace the word 'dominate' on this page w/ something like 'be greatest' or 'be longest'.
I think it's the only weak point of the article, but it does weaken its readability.
Signing the preceding (I think that was my first ever post) Ampers&Amper& 02:05, 21 April 2007 (UTC)