FazBrowse GitHub Viewer | Trending |
URL:
| Home
Tools: [Download Repo ZIP]   [Original HTTPS Page]

proof-complexity · GitHub Topics · GitHub

#

proof-complexity

Here are 4 public repositories matching this topic...

Language: All
Filter by language

A self-verifying proof that the Thiele Machine is a universal model of computation which strictly contains the Turing Machine as a blind, special case. All open source.

  • Updated Jul 23, 2026
  • OCaml

LeastNumber is not decision-tree reducible to StrongAvoid: a coefficient-mass size lower bound for Sigma_2-unary Sherali-Adams, formalised in Lean 4. Answers the open problem in Fleming-Gal-Imrek-Marciot, CCC 2026, Section 6.

  • Updated Aug 19, 2026
  • Python

Code, data, and receipts for Solver-Hard Is Not Model-Hard

  • Updated Jul 18, 2026
  • Python

Improve this page

Add a description, image, and links to the proof-complexity topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the proof-complexity topic, visit your repo's landing page and select "manage topics."

Learn more


Back | FazBrowse Home | New Git URL