Timeline for Target-Value Search (& II)
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 6, 2015 at 23:49 | comment | added | Carlos Linares López | ouch! sorry about that David! I'll try to take care with that! | |
| Sep 6, 2015 at 15:18 | comment | added | David Richerby | Hi, Carlos. I notice that you've been approving quite a lot of edits to posts that are several years old, when those edits do nothing more than improve a certain author's use of capital letters. Please don't do that: accepting these edits brings the old question back onto the front page of the site, which means that recent, active questions get pushed onto the second page, where people don't see them. The issues are similar to the ones raise here. Accepting these edits does more harm than good. Cheers. | |
| Oct 8, 2012 at 13:31 | answer | added | Yuval Filmus | timeline score: 4 | |
| May 9, 2012 at 15:50 | history | edited | Raphael |
edited tags
|
|
| May 2, 2012 at 17:28 | history | edited | Kaveh |
edited tags; edited tags
|
|
| May 2, 2012 at 17:14 | history | tweeted | twitter.com/#!/StackCompSci/status/197735805534474240 | ||
| May 2, 2012 at 13:55 | comment | added | Carlos Linares López | Wou Tsuyoshi! This is a very value response! Would you mind to post it as an aswer? I would happily up vote it. | |
| May 2, 2012 at 13:19 | comment | added | Tsuyoshi Ito | In the case of DAG, all paths can be enumerated in polynomial space and therefore the problem cannot be EXPTIME-complete unless PSPACE=EXPTIME. The natural decision version (given a DAG G, its vertices s and t, and numbers x and y, decide whether there is a path from s to t whose length is between x and y) is in NP. | |
| May 2, 2012 at 13:00 | history | edited | Carlos Linares López | CC BY-SA 3.0 |
added 158 characters in body
|
| May 2, 2012 at 12:21 | history | asked | Carlos Linares López | CC BY-SA 3.0 |