Timeline for Are there any exponential-time iterative algorithms?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2014 at 17:08 | comment | added | Raphael | Yes, trivially so by combining two facts: 1) WHILE-programs (i.e. with no recursion) are Turing-complete. 2) There are problems that require exponential time to solve. | |
| Nov 4, 2014 at 22:19 | answer | added | Giovanni Botta | timeline score: 0 | |
| Nov 4, 2014 at 21:48 | answer | added | David Richerby | timeline score: 1 | |
| Nov 4, 2014 at 21:47 | review | First posts | |||
| Nov 4, 2014 at 21:47 | |||||
| Nov 4, 2014 at 21:39 | history | asked | Yousuf | CC BY-SA 3.0 |