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

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

ICAPS 2012: Invited talk by George Pappas

ICAPS | Aug 18, 2014

ICAPS 2012: Opening Remark & Invited Talk by Robert Ambrose

ICAPS | Aug 18, 2014

ICAPS 2012: Session Ia on "Temporal Planning & Scheduling"

ICAPS | Aug 18, 2014