algebraic-complexity

Here are 3 public repositories matching this topic...

Circuits, Proofs, and Algebra: research papers and reproducible code on complexity lower bounds, motivated by P vs NP and VP vs VNP.

Lean formalization of support-two VNP₁ characteristic-two compilers and class bridges

Machine-checkable exact matrix-multiplication circuits and scalable shared-preprocessing constructions

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