ICALP 2020

A3.C — The complexity of promise SAT on non-Boolean domains

Sep 23, 2020

|

25 views

Saarland Informatics Campus

Details

ICALP-A 2020 The complexity of promise SAT on non-Boolean domains Alex Brandts, Marcin Wrochna, Stanislav Živný

Category: ICALP 2020

Comments

loading...

Reactions (0) | Note

📝 No reactions yet

Be the first one to share your thoughts!

Reactions(0)

Note

loading...

Recommended

Playing Atari with Deep Reinforcement Learning | Two Minute Paper

Two Minute Papers | Mar 7, 2015

ICAPS 2014: Menkes van den Briel on "Flow-based Heuristics for Optimal Planning"

ICAPS | Mar 13, 2015

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