Timeline for Example problems with polynomial and exponential solutions, and tiny footprint?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 15, 2011 at 8:59 | vote | accept | Magnus Lie Hetland | ||
| Jun 26, 2011 at 12:05 | answer | added | Topo | timeline score: 1 | |
| Jun 26, 2011 at 11:15 | answer | added | Rob Simmons | timeline score: 6 | |
| Jun 25, 2011 at 23:24 | answer | added | Neel Krishnaswami | timeline score: 9 | |
| Jun 25, 2011 at 17:32 | history | tweeted | twitter.com/#!/StackCSTheory/status/84675401032531968 | ||
| Jun 25, 2011 at 17:15 | answer | added | Martin Schwarz | timeline score: 5 | |
| Jun 25, 2011 at 16:27 | comment | added | Jukka Suomela | Bipartite maximum-weight matching (Hungarian vs. brute-force)? | |
| Jun 25, 2011 at 15:24 | comment | added | Magnus Lie Hetland | Actually, I was planning on using the pseudopolynomial (“linear in Fibonacci rank”) and superexponential (recursive) solutions to the problem; the main point is the obvious difference in complexity, which lets the weaker computer win easily. | |
| Jun 25, 2011 at 15:17 | history | asked | Magnus Lie Hetland | CC BY-SA 3.0 |