Timeline for Succinct polynomial sized representation of balanced bipartite graphs whose perfect matching count is a primorial
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 11, 2021 at 4:21 | vote | accept | Turbo | ||
| Aug 11, 2021 at 4:21 | comment | added | Turbo | I see you index the graph and the edges. Bummer ok. | |
| Aug 10, 2021 at 22:29 | comment | added | Peter Taylor | @1.., it is now. | |
| Aug 10, 2021 at 22:28 | history | edited | Peter Taylor | CC BY-SA 4.0 |
added 530 characters in body
|
| Aug 10, 2021 at 19:21 | comment | added | Turbo | Note the above answer is not for succinct representations. | |
| Aug 10, 2021 at 12:22 | history | edited | Turbo | CC BY-SA 4.0 |
added 2 characters in body
|
| Aug 10, 2021 at 12:09 | vote | accept | Turbo | ||
| Aug 10, 2021 at 12:12 | |||||
| Aug 10, 2021 at 9:17 | vote | accept | Turbo | ||
| Aug 10, 2021 at 12:07 | |||||
| Aug 10, 2021 at 7:47 | history | answered | Peter Taylor | CC BY-SA 4.0 |