Timeline for Proof that AND-OR graph decision problem is NP-hard
Current License: CC BY-SA 3.0
16 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Apr 5, 2018 at 17:58 | history | bounty ended | user122049 | ||
S Apr 5, 2018 at 17:58 | history | notice removed | user122049 | ||
Apr 3, 2018 at 16:39 | vote | accept | user122049 | ||
Apr 3, 2018 at 13:10 | answer | added | superpringles | timeline score: 1 | |
Apr 2, 2018 at 8:02 | comment | added | Discrete lizard♦ | You have already been given a hint. If you're unsure how to do something, just try it. That said, there's already a slightly more detailed hint. | |
Apr 2, 2018 at 7:51 | answer | added | xskxzr | timeline score: 1 | |
Apr 2, 2018 at 2:20 | comment | added | user122049 | @Discretelizard The problemi is that I do not have any clue how to start...It would be more helpful if you could hint me something. | |
Apr 1, 2018 at 18:01 | history | tweeted | twitter.com/StackCompSci/status/980505526424559618 | ||
Apr 1, 2018 at 17:44 | comment | added | Discrete lizard♦ | I really think finding the answer yourselves is a better idea than awarding a bounty. "What makes you think the point of an exercise is the answer?", as some users say. Ah well, it's your choice in the end, so feel free to ignore my advice if you wish. | |
S Apr 1, 2018 at 17:33 | history | bounty started | user122049 | ||
S Apr 1, 2018 at 17:33 | history | notice added | user122049 | Draw attention | |
Mar 30, 2018 at 16:02 | comment | added | Yuval Filmus | It's a nice challenge for you. | |
Mar 30, 2018 at 16:00 | comment | added | user122049 | @YuvalFilmus Could you elaborate on the transformation? I am quite unsure how a undirected vertex cover graph can be transformed to a DAG And-Or graph. Thanks! | |
Mar 30, 2018 at 15:54 | comment | added | Yuval Filmus | Try vertex cover or set cover. | |
Mar 30, 2018 at 15:28 | review | First posts | |||
Mar 30, 2018 at 15:59 | |||||
Mar 30, 2018 at 15:24 | history | asked | user122049 | CC BY-SA 3.0 |