Timeline for Succinct polynomial sized representation of balanced bipartite graphs whose perfect matching count is a primorial
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 11, 2021 at 4:21 | vote | accept | Turbo | ||
| Aug 10, 2021 at 12:21 | comment | added | Turbo | Makes sense I provided a better formulation. | |
| Aug 10, 2021 at 12:19 | history | edited | Turbo | CC BY-SA 4.0 |
added 263 characters in body; edited title
|
| Aug 10, 2021 at 12:12 | history | edited | Turbo | CC BY-SA 4.0 |
added 263 characters in body; edited title
|
| 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 | answer | added | Peter Taylor | timeline score: 4 | |
| Aug 10, 2021 at 6:45 | comment | added | Peter Taylor | Usually, taking $n$ as input and outputting $K_{n,n}$ would not be considered $P$-time, because the input size is $\log n$ and the output size is $\Theta(n^2 \log n)$. If polynomial time in the value of $n$ rather than its encoded size (equivalently: unary input) is acceptable then there's a trivial answer which will disappoint you on all three points of the motivation. | |
| Aug 10, 2021 at 1:29 | history | edited | Turbo | CC BY-SA 4.0 |
added 270 characters in body
|
| Aug 10, 2021 at 1:23 | history | edited | Turbo | CC BY-SA 4.0 |
added 270 characters in body
|
| Aug 10, 2021 at 1:17 | history | asked | Turbo | CC BY-SA 4.0 |