Skip to content

feat(Classes/Sparse): Kadin's theorem, PH ⊆ P^{NP[O(log n)]} under a sparse Turing-complete set for NP (#2062 M3) - #2077

Merged
SamuelSchlesinger merged 20 commits into
mainfrom
claude/kadin-1989-m3
Oct 31, 2026
Merged

SamuelSchlesinger merged 20 commits into
mainfrom
claude/kadin-1989-m3

Commits

  1. Commits on Oct 31, 2026