Infinite data structures in python
-
Updated
Aug 13, 2026 - Python
Infinite data structures in python
Machine-checked combinatorial lemmas (Lean 4) and certified algorithms (Python) for median-affine SAT decompositions, Poset F2-Carathéodory, and hybrid q-Horn parity systems
A structural-discovery framework for discovering theorem-revealing representations, with proved local-to-global graph structure, intrinsic defect parameters, and independent Python/C++ verification — the Shunyaya Structural Discovery Compiler (SSDC).
Lean 4 formalization of independent set discovery on biclique-free graphs.
Exact rational algorithms, instance bank, and reproducibility records for phylogenetic distance deconvolution with incomplete references.
Parameterised complexity of graph homomorphism to odd cycles. Paper and Lean formalisation.
To associate your repository with the parameterized-complexity topic, visit your repo's landing page and select "manage topics."