km-git-acc / dbn_upper_boundLinks
Computational effort to upper bound the de Bruijn-Newman constant as part of a Polymath project
☆13Updated 2 years ago
Alternatives and similar repositories for dbn_upper_bound
Users that are interested in dbn_upper_bound are comparing it to the libraries listed below
Sorting:
- Methods for accelerating and proving theorems about 5-state Busy Beaver candidates☆20Updated 3 years ago
- Perfectoid spaces in the Lean formal theorem prover.☆125Updated last year
- IMO Grand Challenge for Artificial Intelligence☆46Updated 3 years ago
- Formalization of Statement of Local Langlands Correspondence for Tori☆11Updated 6 years ago
- 💧 Liquid Tensor Experiment☆206Updated last year
- Johan's clone of the cring repository from http://cring.adeel.ru/☆28Updated 12 years ago
- A Learning Environment for Theorem Proving☆75Updated 3 years ago
- The formal proof of the Kepler conjecture☆163Updated last year
- All the math/tex files for the Automorphic Project☆19Updated last year
- Formalization of the existence of sphere eversions☆44Updated 2 weeks ago
- Formalizing results about the Mandelbrot set in Lean☆23Updated last week
- Python talking to the Lean theorem prover☆45Updated 4 years ago
- There is a new version of dReal, available at https://github.com/dreal/dreal4☆50Updated 4 years ago
- KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)☆83Updated 2 months ago
- An open bibliography of machine learning for formal proof papers☆32Updated last year
- Let's translate works of Grothendieck☆27Updated 6 years ago
- Holophrasm: a neural Automated Theorem Prover for higher-order logic☆55Updated 5 years ago
- A formal proof of an exponentially better upper bound on Ramsey numbers☆17Updated last year
- Exact Inference Engine for Probabilistic Programs☆135Updated 5 months ago
- Automatically exported from code.google.com/p/atlasofliegroups☆32Updated last week
- Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver☆77Updated last year
- ☆50Updated 3 years ago
- ☆92Updated last year
- Formalizing convex polyhedra in Coq☆24Updated last year
- Schemes in Lean (v2)☆43Updated 5 years ago
- ☆14Updated 2 years ago
- Some examples of Lean projects, for undergraduate mathematicians.☆23Updated 4 years ago
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆56Updated 10 years ago
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆67Updated last year
- Repository for formalization of the Polynomial Freiman Ruzsa conjecture (and related results)☆183Updated last week