ICALP 2020

A3.F — d-to-1 Hardness of Coloring 3-colorable Graphs with O(1) colors

Sep 23, 2020

|

38 views

Saarland Informatics Campus

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

SREcon14 - Grilled Cheese at Scale: A Recipe for Stability Practices

USENIX | Jun 26, 2014

SREcon14 - Design Review Best Practices

USENIX | Jun 26, 2014

SREcon14 - Keys to SRE

USENIX | Jun 26, 2014

The ICAPS Three

ICAPS | Jul 2, 2014

ICAPS 2014: Daniel Harabor on "Improving Jump Point Search"

ICAPS | Jul 2, 2014