Timeline for Complexity of counting regions in hyperplane arrangements
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2022 at 3:42 | history | edited | Michael Hardy | CC BY-SA 4.0 |
added 3 characters in body
|
| Aug 11, 2022 at 4:44 | history | became hot network question | |||
| Aug 11, 2022 at 1:28 | vote | accept | Igor Pak | ||
| Aug 11, 2022 at 1:02 | answer | added | Timothy Chow | timeline score: 9 | |
| Aug 10, 2022 at 23:13 | comment | added | Igor Pak | @TimothyChow -- You are right. This was a typo. Fixed. Thanks! | |
| Aug 10, 2022 at 23:13 | history | edited | Igor Pak | CC BY-SA 4.0 |
NP -> #P typo fixed
|
| Aug 10, 2022 at 23:06 | comment | added | Timothy Chow | Why doesn't your observation about the Tutte polynomial imply #P-hardness? I'm looking at Theorem 6.2.9 in Welsh, but are you looking at something else in that chapter? | |
| Aug 10, 2022 at 21:11 | history | edited | Igor Pak | CC BY-SA 4.0 |
wikilink added
|
| Aug 10, 2022 at 20:39 | history | asked | Igor Pak | CC BY-SA 4.0 |