Alternatives and similar repositories for fvs

Users that are interested in fvs are comparing it to the libraries listed below

• Gecode / MPG
  Modeling and Programming with Gecode
  ☆45Updated 2 years ago
• mishun / minisat-rust
  Experimental minisat SAT solver reimplementation in Rust
  ☆71Updated 5 years ago
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆49Updated 2 years ago
• herbie-fp / egg-herbie
  An interface for using mwillsey/egg with math simplification.
  ☆13Updated 11 months ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• BoostGSoC17 / static-views
  Proposed compile-time views and maps for Boost
  ☆10Updated 6 years ago
• rise-lang / rise
  Implementation of the RISE language
  ☆14Updated 4 years ago
• DistributedComponents / InfSeqExt
  A Coq library for reasoning (co)inductively on infinite sequences using LTL-like modal operators
  ☆17Updated 2 years ago
• potassco / flatzinc
  🫓 A parser for the FlatZinc modelling language
  ☆13Updated 2 months ago
• isadofschi / combinatorial_nullstellensatz
  A Lean formal proof of the Combinatorial Nullstellensatz
  ☆11Updated 2 years ago
• sdiehl / pyrewrite
  Python term rewriting
  ☆29Updated 12 years ago
• avigad / polya
  A heuristic procedure for proving inequalities
  ☆33Updated 6 years ago
• rocq-community / bits
  A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…
  ☆23Updated last week
• ybyygu / rust-lbfgs
  LBFGS optimization algorithm ported from liblbfgs
  ☆12Updated 2 years ago
• liffiton / minicard
  MiniCard: An efficient cardinality solver based on MiniSAT
  ☆17Updated 3 years ago
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆58Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• rwanwork / Re-Pair
  Offline Dictionary-based Compression (Re-Pair, Recursive Pairing)
  ☆25Updated last year
• flintlib / calcium
  Calcium has been merged into FLINT -- use https://github.com/flintlib/flint/ instead
  ☆81Updated last year
• MarisaKirisame / first_order_logic_prover
  ☆59Updated 7 years ago
• ondrik / libvata
  VATA Tree Automata Library
  ☆32Updated 8 months ago
• astrojhgu / adaptrapezoid_benchmark
  benchmark languages that potentially suitable to scientific computing with the adaptive trapezoid numeric integration algorithm
  ☆21Updated 4 years ago
• math-comp / odd-order
  The formal proof of the Odd Order Theorem
  ☆30Updated 2 weeks ago
• zhangir-azerbayev / mathlib-semantic-search
  ☆14Updated 2 years ago
• b-mehta / combinatorics
  ☆23Updated 2 years ago
• ilyasergey / reachability
  Experimental implementation of k-CFA and Pushdown k-CFA with optional Abstract Garbage Collection for LambdaJS and a subset of Scheme pro…
  ☆31Updated 9 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• stites / CSSR
  Mirror of CSSR: An Algorithm for Building Markov Models from Time Series
  ☆20Updated 5 years ago
• jmd1011 / snek-LMS
  Implementation of Lightweight Modular Staging (LMS) in Python
  ☆48Updated 6 years ago