bordacount VS infinite-search

Compare bordacount vs infinite-search and see what are their differences.

bordacount

Haskell implementation of the Borda count election method (by hverr)
Algorithms
Source Code
Suggest alternative
Edit details

infinite-search

An implementation of Martin Escardo's exhaustively searchable sets in Haskell. (by luqui)
Algorithms
Source Code
Suggest alternative
Edit details
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
bordacount infinite-search
- -
1 6
- -
0.0 0.0
over 6 years ago over 15 years ago
Haskell 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.

bordacount

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

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

infinite-search

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

We haven't tracked posts mentioning infinite-search yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing bordacount and infinite-search you can also consider the following projects:

dgim - :chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.

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

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

toysolver - My sandbox for experimenting with solver algorithms.

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

twentyseven - Rubik's cube solver in Haskell

spacefill - Space-filling curves

Adaptive

ADPfusion - Efficient, high-level dynamic programming

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

bordacount vs dgim infinite-search vs incremental-sat-solver bordacount vs lca infinite-search vs toysolver bordacount vs graph-generators infinite-search vs twentyseven bordacount vs spacefill infinite-search vs spacefill bordacount vs twentyseven infinite-search vs Adaptive bordacount vs ADPfusion infinite-search vs arithmoi