Sign in
ICALP 2020
Event Home
A3.F — d-to-1 Hardness of Coloring 3-colorable Graphs with O(1) colors
Sep 23, 2020
|
38 views
Saarland Informatics Campus
Follow
Graphs
1420 videos · undefined sub area
Details
ICALP-A 2020 d-to-1 Hardness of Coloring 3-colorable Graphs with O(1) colors Venkatesan Guruswami, Sai Sandeep
Category: ICALP 2020
Comments
loading...
Reactions
(0)
| Note
📝 No reactions yet
Be the first one to share your thoughts!
Reactions
(0)
Note
loading...
Recommended
20:54
ICAPS 2014: Menkes van den Briel on "Flow-based Heuristics for Optimal Planning"
ICAPS
| Mar 13, 2015
58:12
SREcon15 - Notes from Production Engineering
USENIX
| Apr 9, 2015
28:16
SREcon15 - Case Study: Adopting SRE Principles at StackOverflow
USENIX
| Apr 9, 2015
44:33
SREcon15 - Monitoring without Infrastructure @ Airbnb
USENIX
| Apr 9, 2015
43:43
SREcon15 - Scaling Networks through Software
USENIX
| Apr 9, 2015