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: Jendrik Seipp on "Diverse and Additive Cartesian Abstraction Heuristics"

ICAPS | Apr 14, 2015

ICAPS 2014: Bram Ridder on "Heuristic Evaluation Based on Lifted Relaxed Planning Graphs"

ICAPS | Apr 14, 2015

ICAPS 2014: Richard Valenzano on "A Comparison of Knowledge-Based GBFS Enhancements and..."

ICAPS | Apr 15, 2015

ICAPS 2014: Florian Pommerening on "LP-Based Heuristics for Cost-Optimal Planning"

ICAPS | Apr 15, 2015

ICAPS 2014: Benjamin Cohen on "Single- and Dual-Arm Motion Planning with Heuristic Search"

ICAPS | Apr 15, 2015