Alternatives and similar repositories for glasgow-subgraph-solver

Users that are interested in glasgow-subgraph-solver are comparing it to the libraries listed below

• domschrei / mallob
  Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.
  ☆73Updated this week
• arminbiere / lingeling
  Lingeling SAT Solver
  ☆105Updated last year
• cuddorg / cudd
  CUDD Decision Diagram Package
  ☆143Updated this week
• audemard / glucose
  The glucose SAT solver
  ☆123Updated 4 months ago
• muhos / ParaFROST
  A Parallel SAT Solver with GPU Accelerated Inprocessing
  ☆129Updated 2 weeks ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆56Updated 2 years ago
• arminbiere / satch
  SAT Solver SATCH
  ☆119Updated 3 years ago
• Laakeri / sharpsat-td
  Entry to model counting competition 2021.
  ☆22Updated last year
• arminbiere / cadical
  CaDiCaL SAT Solver
  ☆485Updated this week
• ssoelvsten / adiar
  An I/O-efficient implementation of (Binary) Decision Diagrams
  ☆30Updated last week
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆50Updated 3 years ago
• alexander-nadel / intel_sat_solver
  This repository contains the code of Intel(R) SAT Solver (IntelSAT)
  ☆33Updated 6 months ago
• Udopia / gbd
  Management of Benchmark Instances and Instance Attributes
  ☆20Updated last week
• marijnheule / drat-trim
  The DRAT-trim proof checker
  ☆65Updated 10 months ago
• meelgroup / approxmc
  Approximate Model Counter
  ☆80Updated last week
• marijnheule / CnC
  Cube-and-Conquer SAT solver
  ☆37Updated 2 months ago
• utwente-fmt / sylvan
  Multi-core Decision Diagram (BDD/LDD) implementation
  ☆44Updated last year
• sat-group / open-wbo
  Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver
  ☆77Updated last year
• arminbiere / gimsatul
  ☆35Updated 2 months ago
• meelgroup / ganak
  High-performance model counter
  ☆46Updated last week
• MassimoLauria / cnfgen
  CNF generator in DIMACS format. It produces common families of CNFs.
  ☆69Updated 2 months ago
• philzook58 / awesome-egraphs
  An awesome list of e-graph resources
  ☆243Updated this week
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆79Updated 3 months ago
• fbacchus / MaxHS
  MaxHS: a hybrid Maxsat solver developed by Jessica Davies and Fahiem Bacchus
  ☆26Updated 3 years ago
• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆485Updated 3 months ago
• maximaximal / Paracooba
  Distributed and ressource elastic cube-and-conquer SAT & QBF solver
  ☆20Updated 2 years ago
• trolando / sylvan
  Implementation of multi-core (binary) decision diagrams
  ☆78Updated last month
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆158Updated last week
• ssoelvsten / buddy
  BuDDy BDD package (with CMake support)
  ☆13Updated last year
• shaowei-cai-group / ParKissat-RS
  Parallel SAT solver that won the SAT Competition 2022 by a large margin (24% faster than the 2nd ranked solver)
  ☆25Updated 2 years ago