| dc.creator |
Jain, Vishesh |
|
| dc.creator |
Sah, Ashwin |
|
| dc.creator |
Sawhney, Mehtaab |
|
| dc.date |
2022-10-21T17:32:00Z |
|
| dc.date |
2022-10-21T17:32:00Z |
|
| dc.date |
2021-06-15 |
|
| dc.date |
2022-10-20T14:19:03Z |
|
| dc.date.accessioned |
2023-02-17T20:03:09Z |
|
| dc.date.available |
2023-02-17T20:03:09Z |
|
| dc.identifier |
978-1-4503-8053-9 |
|
| dc.identifier |
https://hdl.handle.net/1721.1/145932 |
|
| dc.identifier |
Jain, Vishesh, Sah, Ashwin and Sawhney, Mehtaab. 2021. "Perfectly Sampling $k\geq (8/3 +o(1))\Delta$-Colorings in Graphs." |
|
| dc.identifier |
PUBLISHER_POLICY |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/242096 |
|
| dc.format |
application/pdf |
|
| dc.language |
en |
|
| dc.publisher |
ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
|
| dc.relation |
https://doi.org/10.1145/3406325.3451012 |
|
| dc.rights |
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. |
|
| dc.rights |
The author(s) |
|
| dc.source |
ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
|
| dc.title |
Perfectly Sampling $k\geq (8/3 +o(1))\Delta$-Colorings in Graphs |
|
| dc.type |
Article |
|
| dc.type |
http://purl.org/eprint/type/ConferencePaper |
|