Timeline for symmetric difference of languages - both are in NP and coNP
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 21, 2012 at 22:05 | comment | added | Joel David Hamkins | It was my pleasure. I like the question very much, and I think it is a great example to illustrate the point that failing to verify membership is not the same as verifying non-membership. | |
| Mar 21, 2012 at 21:53 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
fixed typo
|
| Mar 21, 2012 at 21:33 | comment | added | Stefan.M | Yes, you are right that my algorithm is wrong, it works only for languages which are both in P. Since P is in NP \cap coNP I thought that way is good but there are some catches. But the truth is there has to be completely another approach throught verifiers and certificates, that's quite obvious. Thank you once again for your explanation. | |
| Mar 21, 2012 at 21:29 | vote | accept | Stefan.M | ||
| Mar 21, 2012 at 20:11 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 129 characters in body; added 1 characters in body
|
| Mar 21, 2012 at 19:58 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 172 characters in body; added 32 characters in body
|
| Mar 21, 2012 at 19:52 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |