qchas alternatives and similar packages

Based on the "Algorithms" category.
Alternatively, view qchas alternatives based on common mentions on social networks and blogs.

arithmoi

9.5 5.6 qchas VS arithmoi

Number theory: primes, arithmetic functions, modular computations, special sequences
build

9.5 1.6 qchas VS build

Build Systems à la Carte

Scout APM: A developer's best friend. Try free for 14-days

Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.

Promo scoutapm.com

toysolver

9.3 8.2 qchas VS toysolver

My sandbox for experimenting with solver algorithms.
ersatz

9.0 3.6 qchas VS ersatz

A monad for interfacing with external SAT solvers
iproute

8.9 0.0 qchas VS iproute

IP Routing Table in Haskell
graphs

8.4 0.0 qchas VS graphs

a monadic graph library
aeson-diff

8.3 1.0 qchas VS aeson-diff

Generate and apply diffs between JSON documents.
funsat

8.3 0.0 qchas VS funsat

An efficient, embeddable DPLL SAT solver in Haskell
primes

8.2 0.0 qchas VS primes

Prime Numbers for Haskell
HMM

8.1 0.0 qchas VS HMM

hidden markov models in haskell
presburger

8.1 0.0 qchas VS presburger

Decision procedures for Presburger arithmetic in Haskell
union-find

8.0 0.0 qchas VS union-find

Efficient union and equivalence testing of sets.
imj-animation

7.7 0.6 qchas VS imj-animation

Monorepo for a multi-player game engine, and game examples
text-metrics

7.7 3.0 qchas VS text-metrics

Calculate various string metrics efficiently in Haskell
lca

7.5 0.0 qchas VS lca

Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
ADPfusion

7.1 5.8 qchas VS ADPfusion

Efficient, high-level dynamic programming
search-algorithms

7.1 0.0 qchas VS search-algorithms

Haskell library containing common graph search algorithms
Adaptive

7.0 0.0 qchas VS Adaptive

Library for incremental computing.
dtw

6.9 0.0 qchas VS dtw

Implementation of Dynamic Time Warping in Haskell
edit-distance

6.7 1.5 qchas VS edit-distance

Edit distance library for Haskell
treeviz

6.3 0.0 qchas VS treeviz

Haskell library for visualizing algorithmic decomposition of computations.
binary-search

6.1 0.0 qchas VS binary-search

Binary and exponential searches
incremental-sat-solver

6.1 0.0 qchas VS incremental-sat-solver

Simple, Incremental SAT Solving as a Haskell Library
integer-logarithms

5.9 0.4 qchas VS integer-logarithms

Integer logarithms, originally split from arithmoi package
ListTree

5.9 3.9 qchas VS ListTree

A List monad transformer and related tools
cmaes

5.7 0.0 L1 qchas VS cmaes

CMA-ES wrapper in Haskell
twentyseven

5.5 0.0 qchas VS twentyseven

Rubik's cube solver in Haskell
DP

5.2 0.0 qchas VS DP

Holder for a bunch of semirings used in ChartParsing
sgd

5.2 0.0 qchas VS sgd

Stochastic gradient descent Haskell library
GraphSCC

5.0 0.0 qchas VS GraphSCC

Tarjan's algorithm for computing strongly connected components
KMP

4.8 0.0 qchas VS KMP

Knuth–Morris–Pratt string searching algorithm
TrieMap

4.8 0.0 qchas VS TrieMap

Generalized tries for Haskell
union-find-array

4.8 1.9 qchas VS union-find-array

ST based union find data structure
infinite-search

4.8 0.0 qchas VS infinite-search

An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
nonlinear-optimization-ad

4.6 0.0 qchas VS nonlinear-optimization-ad

Wrapper of nonlinear-optimization package for using with ad and backprop packages
jps

4.4 0.0 qchas VS jps

:point_right: jump point search for Haskell
primesieve

4.3 0.1 qchas VS primesieve

A collection of packages related to math, algorithms and science, in Haskell.
spacefill

4.2 0.0 qchas VS spacefill

Space-filling curves
adp-multi

4.1 0.0 qchas VS adp-multi

Prototype of ADP for MCFL (multiple context-free languages)
edit-distance-vector

3.9 0.0 qchas VS edit-distance-vector

Calculate edit scripts and distances between Vectors.
graph-generators

3.8 0.0 qchas VS graph-generators

A Haskell library for creating random Data.Graph instances using several pop
primal

3.8 3.2 qchas VS primal

Primitive World of Haskell
pathfinding

3.7 0.0 qchas VS pathfinding

Haskell pathfinding library
edit-distance-linear

3.6 0.0 qchas VS edit-distance-linear

Levenshtein edit distance in linear memory (also turns out to be faster than C++)
stable-marriage

3.3 0.0 qchas VS stable-marriage

library around stable marriage algorithms
bordacount

3.0 0.0 qchas VS bordacount

Haskell implementation of the Borda count election method
epanet-haskell

2.6 0.0 L2 qchas VS epanet-haskell

Call the EPANET toolkit via Haskell's Foreign Function Interface
dgim

2.3 0.0 qchas VS dgim

:chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.
primes-type

2.3 0.0 qchas VS primes-type

Type-safe prime numbers.
learning-hmm

2.3 0.0 qchas VS learning-hmm

Yet another Haskell library for hidden Markov models