ApacheWang

ApacheWang/open-np-hard-research

Open, rigorous, reproducible research on NP-hard problems — starting with 3-SAT.

1 stars 1 forks 1 watchers Python Apache License 2.0

6 Open Issues Need Help Last updated: Jul 24, 2026

Open Issues Need Help

View All on GitHub

Census general minimally UNSAT deficiency-three formulas and certify singular-DP divergence about 2 months ago

help wanted

ApacheWang/open-np-hard-research

1

Open, rigorous, reproducible research on NP-hard problems — starting with 3-SAT.

Python

Certify constant kernels for unsatisfiable hitting clause-sets of deficiency three about 2 months ago

help wanted

ApacheWang/open-np-hard-research

1

Open, rigorous, reproducible research on NP-hard problems — starting with 3-SAT.

Python

Add certified singular-DP normal forms for minimally UNSAT deficiency 1 and 2 about 2 months ago

help wanted

ApacheWang/open-np-hard-research

1

Open, rigorous, reproducible research on NP-hard problems — starting with 3-SAT.

Python

Extend the structural UNSAT classification to at most four clauses about 2 months ago

help wanted

ApacheWang/open-np-hard-research

1

Open, rigorous, reproducible research on NP-hard problems — starting with 3-SAT.

Python

Classify all unsatisfiable canonical CNFs with at most three clauses about 2 months ago

help wanted

ApacheWang/open-np-hard-research

1

Open, rigorous, reproducible research on NP-hard problems — starting with 3-SAT.

Python

Reproduce the bounded DPLL agreement baseline about 2 months ago

help wanted good first issue

ApacheWang/open-np-hard-research

1

Open, rigorous, reproducible research on NP-hard problems — starting with 3-SAT.

Python