incremental-sat-solver
lca
Our great sponsors
| incremental-sat-solver | lca | |
|---|---|---|
| - | 1 | |
| 14 | 24 | |
| - | - | |
| 0.0 | 0.0 | |
| over 7 years ago | about 2 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
incremental-sat-solver
We haven't tracked posts mentioning incremental-sat-solver yet.
Tracking mentions began in Dec 2020.
lca
-
Fastest common prefix algorithm?
And I found another reference: online lowest common ancestor search that is basically using the same tree structure as history trees.
What are some alternatives?
primes - Prime Numbers for Haskell
edit-distance - Edit distance library for Haskell
arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences
union-find - Efficient union and equivalence testing of sets.
pathfinding - Haskell pathfinding library
ersatz - A monad for interfacing with external SAT solvers
KMP - Knuth–Morris–Pratt string searching algorithm
edit-distance-vector - Calculate edit scripts and distances between Vectors.
infinite-search - An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
graphs - a monadic graph library
funsat - An efficient, embeddable DPLL SAT solver in Haskell
adp-multi - Prototype of ADP for MCFL (multiple context-free languages)