Timeline for Is #k-XORSAT #P-complete?
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5, 2011 at 10:44 | history | edited | András Salamon | CC BY-SA 2.5 |
fix notation
|
| Aug 16, 2010 at 7:23 | answer | added | Andrea Montanari | timeline score: 4 | |
| Aug 15, 2010 at 14:13 | comment | added | András Salamon | Thank you for highlighting this, have edited the question so it makes more sense. | |
| Aug 15, 2010 at 14:12 | history | edited | András Salamon | CC BY-SA 2.5 |
clarified question in light of comments and answer
|
| Aug 14, 2010 at 21:05 | history | edited | András Salamon | CC BY-SA 2.5 |
fixed wording as suggested in comments
|
| Aug 14, 2010 at 20:51 | comment | added | Tsuyoshi Ito | Note that some #P-complete problems (e.g. the DNF counting problem) have an FPRAS. Therefore, the #P-completeness does not rule out the existence of an FPRAS. | |
| Aug 14, 2010 at 19:54 | vote | accept | András Salamon | ||
| Aug 14, 2010 at 19:52 | vote | accept | András Salamon | ||
| Aug 14, 2010 at 19:53 | |||||
| Aug 14, 2010 at 19:49 | answer | added | Peter Shor | timeline score: 28 | |
| Aug 14, 2010 at 19:21 | history | asked | András Salamon | CC BY-SA 2.5 |