Revisions to Why doesn't a time cutoff convert NP problems into co-NP? [duplicate]

Post Closed as "Duplicate" by D.W.♦, David Richerby, FrankW, Ran G., vonbrand

Why can't we flip the answer of a NDTM efficiently?

occurred Jun 15, 2014 at 3:03

edited tags

Link

edited Jun 14, 2014 at 7:13

Raphael

72.9k
30
181
393

complexity-theory np co-np

No, it's not a paradox: it's just something that you don't understand.

Link

edited Jun 14, 2014 at 6:03

David Richerby

82.2k
26
144
238

np intuition co-np paradox

[paradox] fits in the 'apparently wrong but actually right' sense; kept mathjaxify

Link

edited Jun 13, 2014 at 5:38

Craig Gidney

5.9k
23
48

np intuition co-np paradox

[paradox] seems useless; mathjaxify

Source Link

edit approved Jun 13, 2014 at 5:38

senshin

155
11

Loading

Tweeted twitter.com/#!/StackCompSci/status/440300183235334144

occurred Mar 3, 2014 at 1:38

added 122 characters in body

Source Link

edited Mar 2, 2014 at 20:56

Craig Gidney

5.9k
23
48

Loading

added 62 characters in body

Source Link

edited Mar 2, 2014 at 20:44

Craig Gidney

5.9k
23
48

Loading

added 62 characters in body

Source Link

edited Mar 2, 2014 at 20:36

Craig Gidney

5.9k
23
48

Loading

Source Link

asked Mar 2, 2014 at 20:31

Craig Gidney

5.9k
23
48

Loading

Stack Exchange Network

Return to Question