Skip to content
View Mintpath's full-sized avatar

Block or report Mintpath

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Pinned Loading

  1. p-neq-np-lean p-neq-np-lean Public

    Machine-verified proof (0 sorries, 2 axioms) that P ≠ NP via exponential circuit lower bounds for Hamiltonian Cycle. Lean 4 formalization with Mathlib. Proves SIZE(HAM_n) ≥ 2^{Ω(n)} using frontier …

    Lean 2

  2. mintpathos-whitepaper mintpathos-whitepaper Public

    1

  3. auy-83-lean auy-83-lean Public

    Lean 4 formalization of the Aho-Ullman-Yannakakis (1983) communication/formula lower-bound framework: fooling sets, rectangle covers, protocol partition number, formula-to-protocol constructions, a…

    Lean 1

  4. kw-games-lean kw-games-lean Public

    This repository is a Lean 4 formalization of the core Karchmer-Wigderson connection between boolean circuit depth and communication complexity.

    Lean 1