• Stars
    star
    20
  • Rank 1,121,974 (Top 23 %)
  • Language
    JavaScript
  • License
    Other
  • Created over 5 years ago
  • Updated over 3 years ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

A Free World Class High Performance SAT Solver

More Repositories

1

tooloud

Overtone Clojure Eclipse Live Coding Dubstep
Clojure
20
star
2

Omega

Omega is an ultra pure lisp dialect, inspired by the work of Gregory Chaitin.
Java
14
star
3

PEQNP

PEQNP Mathematical Solver
C++
13
star
4

mx

Mx is a highly expressive constraint-based music composition system that transforming a high-level representation of musical structure into a MIDI file. Read more http://mx-clojure.blogspot.com/
Clojure
12
star
5

SLIME

SLIME Cloud: A Free Massive World Class High Performance SAT Solver, Winner of Crypto Track and 3rd place on Cloud Track at the SAT Competition 2021.
C++
6
star
6

SAT_EQUATION

UNIVERSAL NUMBER THEORY EQUATION OF SAT
Python
6
star
7

problem-solving-book

Problem Solving: A Practical Workbook
Jupyter Notebook
6
star
8

blue

A Powerful SAT Solver for Java
Java
6
star
9

maxtuno

sharing files on https://twitter.com/maxtuno
Python
5
star
10

DEIDOS

Subset Sum Problem Solver
C++
5
star
11

SATX

SAT-X is a language for constrained optimization and decision problems over positive integers, that work with any SAT Competition standard SAT solver. Is based on Python, and is ase to learn and easy to use with all technologies associated to this language.
Python
5
star
12

Advanced-Algorithmic-Composition

Advanced Algorithmic Composition Book by Oscar Riveros
Python
5
star
13

Clojure---JSR-331---Puzzles

Clojure & JSR-331 - Puzzles
Clojure
4
star
14

Quantum-Programming-with-Quipper

Quantum Programming Series with Quipper by Oscar Riveros
Haskell
4
star
15

Assembler64

Some Standard Algorithm on Assembler 64
C++
4
star
16

UNT_Book

Elements Of Universal Number Theory Book
Python
4
star
17

sat_equation_and_abstract_binary_search

Some Update from
C++
3
star
18

HESS-SHA256

A sha256 sequential inverter with HESS algorithm.
C++
3
star
19

CVRP

A simple CVRP solver based on O. Riveros HESS black-box algorithm www.peqnp.com
C++
3
star
20

Complexity-Tools

Complexity: Reductions, Scripts, Tools.
C
3
star
21

On_UNT_Union_Find_Algorithm

A O(n) UNT ALGORITHM FOR THE UNION-FIND PROBLEM
Jupyter Notebook
3
star
22

HESS_PAPER

Approximation Ratio of a Deterministic Polynomial Black Box Over a MaxSAT Oracle
Jupyter Notebook
3
star
23

CircuitSAT

A Circuit SAT language that emit CNF code.
Python
3
star
24

BASILISK-SAT-SOLVER

Simple and efficient pure CDCL algorithm for educational purposes.
C++
3
star
25

quark_sat

A complete SAT solver implemented on few lines of C code.
C
3
star
26

hess_max3lin

A polynomial time MAX3LIN aproximator that break the inapproximability ratio always?
C
3
star
27

PEQNP_EXAMPLES

Advanced PEQNP Examples
Jupyter Notebook
3
star
28

Forrelation

The HESS polynomial black-box algorithm solve a problem related to "Forrelation" problem.
Python
3
star
29

HESS_TSP

ORiveros HESS Black Box Algorithm (for TSP)
C
3
star
30

OLD_RESEARCH

Very Old Research For Historical Purposes
Python
3
star
31

MetaCUDA

CUDA + Template Meta-Programming
Cuda
3
star
32

HESS_HP

HESS black-box for Hamiltonian Path Problem
C
3
star
33

HESS-KNAPSACK

A HESS Knapsack O(n^2.x) + O(Oracle) Pseudo (exact in many cases) Optimal Solver
C++
3
star
34

HESS

HESS black-box algorithm from http://www.peqnp.com
Python
3
star
35

hess_mt

A polynomial time "incomplete?" SAT Solver.
C
3
star
36

HESS-SAT-COMPLETE

The original HESS (Hyper Exponential Space Sorting) is a polynomial black-box optimization algorithm, that work very well with any NP-Complete, or NP-Hard problem, at 2021 thanks to suggestions of Daniel Mattes, work like a complete algorithm.
C++
3
star
37

CDCL

A simple and pure CDCL algorithm for experiment with new heuristics...
C++
2
star
38

black_hole

"Black Hole" a (API) Template for a Optimal HPC SAT Solver
C
2
star
39

ORiveros-PEQNP-Benchmarks-sat2020

O. Riveros PEQNP Benchmarks SAT 2020 Competition
2
star
40

Permutation-Reconstruction-from-Differences

Permutation Reconstruction from Differences is NP-complete.
Python
2
star
41

SLIME_SOLVED_UNKNOWN_INSTANCES

UNKNOWN Status Solved Instances by SLIME 5 with HESS and BOOST algorithm
2
star
42

CERBERO

A C89 SAT Solver with DRUP Proof
C
2
star
43

MiniSat

MiniSat 2.2.0 with DRUP proof, CMake and StarExec Ready.
C++
2
star
44

V

My V Lang Codes https://vlang.io
V
2
star
45

TTP_Validator

Simple Template or Validator for "Travelling Thief Problem"
Python
2
star
46

quark_sat-

A complete SAT solver implemented on few lines of C++ code. (A C++ version of https://github.com/maxtuno/quark_sat)
C++
2
star
47

Distributed-Algorithms

Distributed Algorithms Examples
Fortran
2
star
48

Partition_Ramanujan

Integer Partitions
Python
2
star
49

CNFExamples

PEQN CNF Submodule Examples
Python
2
star
50

python3-cpp

basic python native extensions examples
Python
2
star
51

DEIDOS-ULTIMATE-BENCHMARKS

DEIDOS ULTIMATE (NP-Complete Problem Solver) Benchmarks
Python
2
star
52

HESS-GSP

HESS Algorithm for General Satiafiability Problem (On Multivalued Logics)
Python
2
star
53

Calculator

A simple calculator created in 5 minutes with ANTLR4, an example of a small interpreted language with centralized object. (for fun)
Java
2
star
54

DEIDOS-BENCHMARKS-DUEL

DEIDOS (NP-Complete Problem Solver) vs THE WORLD
Python
2
star
55

peqnp_jvm

PEQNP Java Interop with Jython Example
Java
2
star
56

HESS-paper

The companion materials to HESS algorithm paper.
Shell
2
star
57

snippets

some (HPC) code snippets (for reference)
C
2
star
58

big-csp-examples

Polynomial Constrained Integer Programming Examples with Big-CSP
Python
2
star
59

CNFX

A base -1 + i CNF encoder for complex field operations.
Python
1
star
60

Hyper-Exponential-Space-Sorting

HESS (New Feature 2021) polynomial black-box for Hamiltonian Path Problem
C
1
star
61

HESS-HAMPATH-COMPLETE

The original HESS (Hyper Exponential Space Sorting) is a polynomial black-box optimization algorithm, that work very well with any NP-Complete, or NP-Hard problem, at 2021 thanks to suggestions of Daniel Mattes, work like a complete algorithm.
C
1
star
62

Hyperconvergent-Prompt-Engineering

Engineering that combines the speed in task execution with the integration of hyperconvergent technologies, involving a convergence of computing, storage, and networking resources in a unified and agile environment, with a high degree of human interaction and artificial intelligence.
Python
1
star