@problem-solving/sat (npm): Boolean formula satisfiability algorithms for JavaScript
Keywords: NP|SAT|algorithms|boolean formula|complete|complexity|computer science|javascript|js|satisfiability|agpl|computer-science|k-sat|np-complete|reductions|sat-solver|sat0w