Efficient basic number-theoretic functions. Primes, powers, integer logarithms.

arithmoi alternatives and similar packages

Based on the "Algorithms" category

• build

  9.5 4.8 arithmoi VS build

  Build systems a la carte

• toysolver

  9.3 7.4 arithmoi VS toysolver

  Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

• ersatz

  9.1 5.3 arithmoi VS ersatz

  A monad for expressing SAT or QSAT problems using observable sharing.

• iproute

  8.9 4.5 arithmoi VS iproute

  IP Routing Table

• graphs

  8.5 2.4 arithmoi VS graphs

  A simple monadic graph library

• HMM

  8.2 0.0 arithmoi VS HMM

  A hidden markov model library

• primes

  8.2 0.0 arithmoi VS primes

  Efficient, purely functional generation of prime numbers

• funsat

  8.1 0.0 arithmoi VS funsat

  A modern DPLL-style SAT solver

• presburger

  7.9 0.9 arithmoi VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• union-find

  7.8 0.0 arithmoi VS union-find

  Efficient union and equivalence testing of sets.

• aeson-diff

  7.8 2.4 arithmoi VS aeson-diff

  Extract and apply patches to JSON documents.

• imj-animation

  7.7 0.0 arithmoi VS imj-animation

  Animation Framework

• text-metrics

  7.7 4.3 arithmoi VS text-metrics

  Calculate various string metrics efficiently

• lca

  7.5 2.7 arithmoi VS lca

  O(log n) persistent on-line lowest common ancestor calculation without preprocessing

• search-algorithms

  7.2 2.2 arithmoi VS search-algorithms

  Common graph search algorithms

• Adaptive

  7.1 0.0 arithmoi VS Adaptive

  Library for incremental computing.

• dtw

  7.0 0.0 arithmoi VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.5 0.0 arithmoi VS treeviz

  Visualization of computation decomposition trees.

• edit-distance

  6.4 2.2 arithmoi VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• ADPfusion

  6.2 0.0 arithmoi VS ADPfusion

  Efficient, high-level dynamic programming.

• qchas

  6.2 0.3 arithmoi VS qchas

  A library for implementing Quantum Algorithms

• incremental-sat-solver

  6.1 0.0 arithmoi VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• integer-logarithms

  5.4 2.5 arithmoi VS integer-logarithms

  Integer logarithms.

• ListTree

  5.3 0.0 arithmoi VS ListTree

  Trees and monadic trees expressed as monadic lists where the underlying monad is a list

• cmaes

  5.0 0.0 L1 arithmoi VS cmaes

  CMA-ES wrapper in Haskell

• sgd

  4.8 7.0 arithmoi VS sgd

  Stochastic gradient descent

• nonlinear-optimization-ad

  4.8 6.2 arithmoi VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• TrieMap

  4.6 0.0 arithmoi VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• binary-search

  4.6 0.0 arithmoi VS binary-search

  Binary and exponential searches

• primesieve

  4.3 1.9 arithmoi VS primesieve

  FFI bindings for the primesieve library.

• union-find-array

  4.3 0.0 arithmoi VS union-find-array

  union find data structure

• edit-distance-vector

  4.3 0.0 arithmoi VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• KMP

  4.3 0.7 arithmoi VS KMP

  Knuth–Morris–Pratt string searching algorithm

• graph-generators

  4.1 0.0 arithmoi VS graph-generators

  Functions for generating structured or random FGL graphs

• infinite-search

  4.1 0.0 arithmoi VS infinite-search

  Exhaustively searchable infinite sets.

• DP

  4.1 0.0 arithmoi VS DP

  Pragmatic framework for dynamic programming

• jps

  4.0 0.0 arithmoi VS jps

  Jump point search for Haskell

• pathfinding

  4.0 0.0 arithmoi VS pathfinding

  pathfinding in grid and graphs

• spacefill

  3.8 0.0 arithmoi VS spacefill

  Generators for space-filling curves.

• edit-distance-linear

  3.1 6.7 arithmoi VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• GraphSCC

  3.1 0.0 arithmoi VS GraphSCC

  Tarjan's algorithm for computing the strongly connected components of a graph.

• twentyseven

  2.9 0.0 arithmoi VS twentyseven

  Rubik's cube solver

• epanet-haskell

  2.9 0.0 L2 arithmoi VS epanet-haskell

  Haskell binding for EPANET

• fibonacci

  2.9 0.0 arithmoi VS fibonacci

  Fast computation of Fibonacci numbers.

• learning-hmm

  2.5 0.0 arithmoi VS learning-hmm

  Yet another library for hidden Markov models

• stable-marriage

  2.5 0.0 arithmoi VS stable-marriage

  algorithms around stable marriage

• dgim

  2.5 0.0 arithmoi VS dgim

  Implementation of DGIM algorithm

• bordacount

  2.4 0.0 arithmoi VS bordacount

  Implementation of the Borda count election method.

• primes-type

  2.4 0.0 arithmoi VS primes-type

  Type-safe prime numbers.

• adp-multi

  2.1 0.0 arithmoi VS adp-multi

  ADP for multiple context-free languages

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.

Do you think we are missing an alternative of arithmoi or a related project?

Popular Comparisons

• arithmoi
  vs
  union-find
• arithmoi
  vs
  twentyseven
• arithmoi
  vs
  incremental-sat-solver
• arithmoi
  vs
  spacefill
• arithmoi
  vs
  edit-distance-vector

SaaSHub - Software Alternatives and Reviews View more from us