Sign in
ICALP 2020
Event Home
A3.C — The complexity of promise SAT on non-Boolean domains
Sep 23, 2020
|
25 views
Saarland Informatics Campus
Follow
A3C
2 videos · undefined sub area
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
46:16
ICAPS 2012: Awards & Best Dissertation Presentations
ICAPS
| Aug 19, 2014
19:31
ICAPS 2014: Miquel Ramírez on "Directed Fixed-Point Regression-Based Planning..."
ICAPS
| Sep 22, 2014
26:22
Representation Learning: A Review and New Perspectives
AISTATS 2014
| Nov 12, 2014
1:43
Playing Atari with Deep Reinforcement Learning | Two Minute Paper
Two Minute Papers
| Mar 7, 2015
20:54
ICAPS 2014: Menkes van den Briel on "Flow-based Heuristics for Optimal Planning"
ICAPS
| Mar 13, 2015