Alternatives and similar repositories for OPOT:

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

• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• MassimoLauria / cnfgen
  CNF generator in DIMACS format. It produces common families of CNFs.
  ☆63Updated 9 months ago
• probsys / optimal-approximate-sampling
  Optimal approximate sampling from discrete probability distributions
  ☆17Updated 3 years ago
• martinResearch / PySparseLP
  python algorithms to solve sparse linear programming problems
  ☆28Updated last year
• maxhutch / magma
  Fork of magma to include more BLAS
  ☆28Updated 8 years ago
• eylonyogev / Where-s-That-Paper-
  A Chrome extension that automatically adds viewed academic papers to your favorites.
  ☆16Updated 6 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆201Updated 2 months ago
• offconvex / offconvex.github.io
  Off the convex path
  ☆67Updated 2 years ago
• nimaanari / theory.report
  Theory of Computing Report
  ☆12Updated 4 months ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 3 years ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆50Updated last year
• gpeyre / 2017-ot-beginners
  Optimal Transport for Dummies - Code, slides and article
  ☆32Updated 7 years ago
• liffiton / PyMiniSolvers
  A Python API for the MiniSat and MiniCard constraint solvers.
  ☆19Updated last year
• quasisphere / conv64
  Exact 64-bit convolution algorithm
  ☆15Updated 8 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated 2 weeks ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 2 weeks ago
• VieCut / VieCut
  VieCut 1.00 - Shared-memory Minimum Cuts
  ☆43Updated 2 years ago
• PrincetonLIPS / randomized_telescopes
  Code for "Efficient optimization of loops and limits with randomized telescoping sums"
  ☆27Updated 5 years ago
• niklasso / minisatp
  The Pseudo-Boolean Solver MiniSat+
  ☆27Updated 12 years ago
• nbonneel / network_simplex
  Fast optimal transport code
  ☆55Updated 4 years ago
• km-git-acc / dbn_upper_bound
  Computational effort to upper bound the de Bruijn-Newman constant as part of a Polymath project
  ☆13Updated last year
• twistedcubic / que-outlier-detection
  [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.
  ☆26Updated 5 years ago
• dselsam / neurocore-public
  NeuroCore: Guiding CDCL with Unsat-Core Predictions
  ☆44Updated 5 years ago
• alex-87 / HyperGraphLib
  C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.
  ☆21Updated 2 years ago
• ilyaraz / ot_estimators
  Implementations of several fast approximate algorithms for geometric optimal transport (OT)
  ☆117Updated 4 years ago
• nalinbhardwaj / min-cut-paper
  A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)
  ☆12Updated 4 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆82Updated 5 years ago
• kedlaya / tetrahedra
  ☆35Updated 3 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 3 years ago
• facebookresearch / LA-MCTS
  High dimensional black-box optimizer using Latent Action Monte Carlo Tree Search algorithm
  ☆26Updated 2 years ago