The complexity of promise SAT on non-Boolean domains. (English) Zbl 1495.68157
MSC:
68R07 | Computational aspects of satisfiability |
08A70 | Applications of universal algebra in computer science |
68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
68Q25 | Analysis of algorithms and problem complexity |