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: Menkes van den Briel on "Flow-based Heuristics for Optimal Planning"

ICAPS | Mar 13, 2015

SREcon15 - Notes from Production Engineering

USENIX | Apr 9, 2015

SREcon15 - Case Study: Adopting SRE Principles at StackOverflow

USENIX | Apr 9, 2015

SREcon15 - Monitoring without Infrastructure @ Airbnb

USENIX | Apr 9, 2015

SREcon15 - Scaling Networks through Software

USENIX | Apr 9, 2015