Timeline for Optimization version of decision problems
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 13, 2017 at 18:18 | history | suggested | Luke Miles | CC BY-SA 3.0 |
made math notation consistent within question
|
| Apr 12, 2017 at 18:22 | review | Suggested edits | |||
| S Apr 13, 2017 at 18:18 | |||||
| Apr 5, 2012 at 15:54 | history | tweeted | twitter.com/#!/StackCompSci/status/187931171823435776 | ||
| Apr 1, 2012 at 21:06 | answer | added | Ran G. | timeline score: 5 | |
| Apr 1, 2012 at 11:46 | answer | added | uli | timeline score: 33 | |
| Apr 1, 2012 at 8:48 | comment | added | Raphael | Depending on your viewpoint, the question is either trivial (take any decision problem that does not have a "$k$") or not answerable (how to prove that there "no equivalent opt. problem"?). | |
| Apr 1, 2012 at 8:47 | history | edited | Raphael | CC BY-SA 3.0 |
formulations; adds general version of opt->dec transformation
|
| Apr 1, 2012 at 8:00 | history | edited | Kaveh |
edited tags
|
|
| Apr 1, 2012 at 7:59 | history | migrated | from cstheory.stackexchange.com (revisions) | ||
| Mar 31, 2012 at 18:01 | comment | added | Kaveh | You have to explain "equivalent" in more detail, e.g. do you mean one can be solved using the other as an oracle/blackbox in polynomial time (or in logarithmic space)? Do you care about all problems or only problems inside $\sf{NP}$? | |
| Mar 31, 2012 at 13:27 | comment | added | JeffE | Is this bit equal to zero? | |
| Mar 31, 2012 at 6:30 | history | asked | bek | CC BY-SA 3.0 |