Q/A Slot A3 — ICALP-A

ICALP 2020

Q/A Slot A3 — ICALP-A

Sep 23, 2020
|
31 views
Details
WED, 08.07.2020, 14:00-15:00 UTC+2 Papers: • Counting solutions to random CNF formulas • On the central levels problem • The complexity of promise SAT on non-Boolean domains • Conditionally optimal approximation algorithms for the girth of a directed graph • Medians in median graphs and their cube complexes in linear time • d-to-1 Hardness of Coloring 3-colorable Graphs with O(1) colors

Comments
loading...