funsat VS HMM

Compare funsat vs HMM and see what are their differences.

funsat

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

HMM

hidden markov models in haskell (by mikeizbicki)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
funsat HMM
- -
35 34
- -
0.0 0.0
almost 9 years ago almost 8 years ago
Groff Haskell
BSD 3-clause "New" or "Revised" License BSD 3-clause "New" or "Revised" 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.

HMM

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

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

What are some alternatives?

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

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

dtw - Implementation of Dynamic Time Warping in Haskell

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

twentyseven - Rubik's cube solver in Haskell

sgd - Stochastic gradient descent Haskell library

Ritt-Wu

learning-hmm - Yet another Haskell library for hidden Markov models

build - Build Systems à la Carte

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

binary-search - Binary and exponential searches

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