Login / Signup
The complexity of promise SAT on non-Boolean domains.
Alex Brandts
Marcin Wrochna
Stanislav Zivný
Published in:
CoRR (2019)
Keyphrases
</>
worst case
boolean functions
computational complexity
application domains
satisfiability problem
real valued
real world
computational cost
decision problems
information retrieval
genetic algorithm
cross domain
space complexity
search problems
complex domains