Popularity
6.0
Declining
Activity
0.0
Stable
14
2
3
Monthly Downloads: 49
Programming language: Haskell
License: BSD 3-clause "New" or "Revised" License
Tags:
Algorithms
incremental-sat-solver alternatives and similar packages
Based on the "Algorithms" category.
Alternatively, view incremental-sat-solver alternatives based on common mentions on social networks and blogs.
-
arithmoi
Number theory: primes, arithmetic functions, modular computations, special sequences -
toysolver
My sandbox for experimenting with solver algorithms. -
aeson-diff
Generate and apply diffs between JSON documents. -
union-find
Efficient union and equivalence testing of sets. -
presburger
Decision procedures for Presburger arithmetic in Haskell -
imj-animation
Monorepo for a multi-player game engine, and game examples -
text-metrics
Calculate various string metrics efficiently in Haskell -
search-algorithms
Haskell library containing common graph search algorithms -
lca
Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing -
integer-logarithms
Integer logarithms, originally split from arithmoi package -
treeviz
Haskell library for visualizing algorithmic decomposition of computations. -
nonlinear-optimization-ad
Wrapper of nonlinear-optimization package for using with ad and backprop packages -
GraphSCC
Tarjan's algorithm for computing strongly connected components -
infinite-search
An implementation of Martin Escardo's exhaustively searchable sets in Haskell. -
union-find-array
ST based union find data structure -
primesieve
A collection of packages related to math, algorithms and science, in Haskell. -
adp-multi
Prototype of ADP for MCFL (multiple context-free languages) -
edit-distance-vector
Calculate edit scripts and distances between Vectors. -
graph-generators
A Haskell library for creating random Data.Graph instances using several pop -
edit-distance-linear
Levenshtein edit distance in linear memory (also turns out to be faster than C++) -
stable-marriage
library around stable marriage algorithms -
bordacount
Haskell implementation of the Borda count election method -
epanet-haskell
Call the EPANET toolkit via Haskell's Foreign Function Interface -
learning-hmm
Yet another Haskell library for hidden Markov models
Less time debugging, more time building
Scout APM allows you to find and fix performance issues with no hassle. Now with error monitoring and external services monitoring, Scout is a developer's best friend when it comes to application development.
Promo
scoutapm.com
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of incremental-sat-solver or a related project?