ICALP 2020

Q/A Slot A3 — ICALP-A

Sep 23, 2020

|

31 views

Saarland Informatics Campus

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

Category: ICALP 2020

Comments

loading...

Reactions (0) | Note

📝 No reactions yet

Be the first one to share your thoughts!

Reactions(0)

Note

loading...

Recommended

ICAPS 2014: Steven Levine on "Concurrent Plan Recognition and Execution for Human-Robot Teams"

ICAPS | May 4, 2015

ICAPS 2014: Peng Yu on "Resolving Uncontrollable Conditional Temporal Problems Using ..."

ICAPS | May 4, 2015

ICAPS 2014: Mikael Nilsson on "EfficientIDC: A Faster Incremental Dynamic Controllability ..."

ICAPS | May 4, 2015

ICAPS 2014: Manuel Heusner on "Under-Approximation Refinement for Classical Planning"

ICAPS | May 5, 2015

ICAPS 2014: Jörg Hoffmann on "Improved Features for Runtime Prediction of Domain-Independent ..."

ICAPS | May 5, 2015