k-SAT
Description: A Boolean satisfiability problem asking whether a formula in conjunctive normal form, with clauses of at most k literals, can be satisfied.
Primary topic: Constraint Satisfaction and Optimization (42%)
Wikidata ID: wiki/Q875276
OpenAlex ID: keywords/k-sat
