npmjs.org : @problem-solving/sat
Boolean formula satisfiability algorithms for JavaScript
Registry
-
Source
- Homepage
- JSON
- codemeta.json
purl: pkg:npm/%40problem-solving/sat
Keywords:
NP
, SAT
, algorithms
, boolean formula
, complete
, complexity
, computer science
, javascript
, js
, satisfiability
, agpl
, computer-science
, k-sat
, np-complete
, reductions
, sat-solver
, sat0w
License: AGPL-3.0
Latest release: almost 4 years ago
First release: almost 4 years ago
Namespace: problem-solving
Dependent packages: 1
Downloads: 16 last month
Stars: 6 on GitHub
Forks: 0 on GitHub
Total Commits: 453
Committers: 8
Average commits per author: 56.625
Development Distribution Score (DDS): 0.609
More commit stats: commits.ecosyste.ms
See more repository details: repos.ecosyste.ms
Last synced: 5 days ago