Package to solve the Generalized Pell Equation.

pell alternatives and similar packages

Based on the "Algorithms" category

• build

  9.5 2.7 pell VS build

  Build systems a la carte

• arithmoi

  9.5 8.4 pell VS arithmoi

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

• toysolver

  9.3 7.8 pell VS toysolver

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

SaaSHub - Software Alternatives and Reviews

SaaSHub will help you find the best software and product alternatives

Promoted www.saashub.com



• ersatz

  9.0 3.9 pell VS ersatz

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

• iproute

  8.8 4.5 pell VS iproute

  IP Routing Table

• graphs

  8.4 2.5 pell VS graphs

  A simple monadic graph library

• aeson-diff

  8.3 2.7 pell VS aeson-diff

  Extract and apply patches to JSON documents.

• funsat

  8.2 0.0 pell VS funsat

  A modern DPLL-style SAT solver

• primes

  8.2 0.0 pell VS primes

  Efficient, purely functional generation of prime numbers

• HMM

  8.1 0.0 pell VS HMM

  A hidden markov model library

• presburger

  8.0 1.9 pell VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• union-find

  7.9 0.0 pell VS union-find

  Efficient union and equivalence testing of sets.

• text-metrics

  7.6 4.8 pell VS text-metrics

  Calculate various string metrics efficiently

• imj-animation

  7.6 6.8 pell VS imj-animation

  Animation Framework

• lca

  7.4 2.6 pell VS lca

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

• Adaptive

  7.3 0.0 pell VS Adaptive

  Library for incremental computing.

• search-algorithms

  7.2 1.7 pell VS search-algorithms

  Common graph search algorithms

• dtw

  6.9 0.0 pell VS dtw

  (Fast) Dynamic Time Warping

• ADPfusion

  6.7 7.0 pell VS ADPfusion

  Efficient, high-level dynamic programming.

• treeviz

  6.4 0.0 pell VS treeviz

  Visualization of computation decomposition trees.

• edit-distance

  6.3 3.0 pell VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• qchas

  6.3 0.0 pell VS qchas

  A library for implementing Quantum Algorithms

• incremental-sat-solver

  6.3 0.0 pell VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• ListTree

  6.0 0.0 pell VS ListTree

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

• cmaes

  5.8 0.0 L1 pell VS cmaes

  CMA-ES wrapper in Haskell

• integer-logarithms

  5.2 2.4 pell VS integer-logarithms

  Integer logarithms.

• twentyseven

  5.2 0.0 pell VS twentyseven

  Rubik's cube solver

• primesieve

  5.2 1.4 pell VS primesieve

  FFI bindings for the primesieve library.

• binary-search

  4.9 0.0 pell VS binary-search

  Binary and exponential searches

• DP

  4.9 0.0 pell VS DP

  Pragmatic framework for dynamic programming

• nonlinear-optimization-ad

  4.6 5.5 pell VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• sgd

  4.6 0.3 pell VS sgd

  Stochastic gradient descent

• GraphSCC

  4.6 0.0 pell VS GraphSCC

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

• union-find-array

  4.4 0.0 pell VS union-find-array

  union find data structure

• infinite-search

  4.4 0.0 pell VS infinite-search

  Exhaustively searchable infinite sets.

• TrieMap

  4.4 0.0 pell VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• KMP

  4.4 0.0 pell VS KMP

  Knuth–Morris–Pratt string searching algorithm

• edit-distance-vector

  4.2 0.0 pell VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• graph-generators

  4.1 0.0 pell VS graph-generators

  Functions for generating structured or random FGL graphs

• jps

  3.8 0.0 pell VS jps

  Jump point search for Haskell

• pathfinding

  3.8 0.0 pell VS pathfinding

  pathfinding in grid and graphs

• edit-distance-linear

  3.8 4.8 pell VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• spacefill

  3.6 0.0 pell VS spacefill

  Generators for space-filling curves.

• adp-multi

  3.6 0.0 pell VS adp-multi

  ADP for multiple context-free languages

• primal

  3.3 8.7 pell VS primal

  Primeval world of Haskell.

• epanet-haskell

  2.9 0.0 L2 pell VS epanet-haskell

  Haskell binding for EPANET

• dgim

  2.6 0.0 pell VS dgim

  Implementation of DGIM algorithm

• stable-marriage

  2.6 3.5 pell VS stable-marriage

  algorithms around stable marriage

• learning-hmm

  2.6 0.0 pell VS learning-hmm

  Yet another library for hidden Markov models

• bordacount

  2.3 0.0 pell VS bordacount

  Implementation of the Borda count election method.

* 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 pell or a related project?

Popular Comparisons

• pell
  vs
  fibonacci
• pell
  vs
  graph-generators
• pell
  vs
  ADPfusionSet
• pell
  vs
  lca
• pell
  vs
  twentyseven