funsat VS dtw

Compare funsat vs dtw and see what are their differences.

funsat

An efficient, embeddable DPLL SAT solver in Haskell (by dbueno)

dtw

Implementation of Dynamic Time Warping in Haskell (by fhaust)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
funsat dtw
- -
35 18
- -
0.0 0.0
almost 9 years ago about 1 year ago
Groff Haskell
BSD 3-clause "New" or "Revised" License MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.

funsat

Posts with mentions or reviews of funsat. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning funsat yet.
Tracking mentions began in Dec 2020.

dtw

Posts with mentions or reviews of dtw. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning dtw yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing funsat and dtw you can also consider the following projects:

incremental-sat-solver - Simple, Incremental SAT Solving as a Haskell Library

edit-distance - Edit distance library for Haskell

graph-generators - A Haskell library for creating random Data.Graph instances using several pop

HMM - hidden markov models in haskell

twentyseven - Rubik's cube solver in Haskell

nonlinear-optimization-ad - Several Haskell packages for numerical optimizations.

Ritt-Wu

build - Build Systems à la Carte

arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences

binary-search - Binary and exponential searches

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