The Complexity of Promise SAT on Non-Boolean Domains.

Alex Brandts Marcin Wrochna Stanislav Zivný

Published in: ICALP (2020)

Keyphrases

real world
application domains
data sets
decision trees
computational complexity
computational cost
satisfiability problem
sat solvers
space complexity
worst case
np complete
search strategies
real valued