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: Peter Stone on "TEXPLORE: Real-Time Sample-Efficient Reinforcement Learning for Robots"

ICAPS | Aug 6, 2014

ICAPS 2014: Ron Alford on "On the Feasibility of Planning Graph Style Heuristics for HTN Planning"

ICAPS | Aug 6, 2014

ICAPS 2014: Mike Barley on "Overcoming the Utility Problem in Heuristic Generation: ..."

ICAPS | Aug 7, 2014

ICAPS 2014: Stefan Edelkamp on "Symbolic and Explicit Search Hybrid through Perfect Hash Functions"

ICAPS | Aug 7, 2014

ICAPS 2012: Invited Talk by Anthony Cohn

ICAPS | Aug 15, 2014