feat(Classes/Hierarchy): nondeterministic exponential time hierarchy by lazy diagonalization (#1539 M2) by SamuelSchlesinger · Pull Request #2074 · cslib-community/complexitylib

feat(Classes/Time): explicit-time verifier characterization of NTIME (#1572)

SamuelSchlesinger

and

claude

committed

415d328

Merge origin/main into claude/ntime-hierarchy

SamuelSchlesinger

committed

d0d8822

feat(Classes/Hierarchy): coarse nondeterministic time hierarchy by lazy diagonalization (#1572)

SamuelSchlesinger

and

claude

committed

4a2a973

refactor(Classes/Space): use the public bounded-existential edges in setOf_exists_mem_PSPACE

SamuelSchlesinger

and

claude

committed

123ef60

doc(Classes/Hierarchy): state the interval cases of the lazy diagonal verifier precisely

SamuelSchlesinger

and

claude

committed

ba518a6

Merge origin/main into claude/ntime-exp-hierarchy-1539

SamuelSchlesinger

and

claude

committed

a88a422

feat(Classes/Hierarchy): nondeterministic exponential time hierarchy by lazy diagonalization (#1539 M2)

SamuelSchlesinger

and

claude

committed

e3a2699

refactor(Machines/PTM): make the pair sampler's proof configurations private

SamuelSchlesinger

and

claude

committed

48a6545

Merge branch 'claude/ntime-hierarchy' into claude/ntime-lazy-diagonal

SamuelSchlesinger

committed

0a0db5a

Merge remote-tracking branch 'origin/main' into claude/ntime-lazy-diagonal

SamuelSchlesinger

committed

e994581

refactor(BigO/Bounds): make ComputableInO.mono_time public

SamuelSchlesinger

and

claude

committed

4e1cc48

Merge branch 'claude/ntime-lazy-diagonal' into claude/ntime-exp-hierarchy-1539

SamuelSchlesinger

committed

a61d1df

refactor(Classes/Hierarchy): use the public ComputableInO.mono_time

SamuelSchlesinger

and

claude

committed

52a4e6c

refactor(Machines/Complexity): share the exponential resource rules of the hierarchy proof

SamuelSchlesinger

and

claude

committed

d6b78e1

Merge origin/main into claude/ntime-exp-hierarchy-1539

SamuelSchlesinger

and

claude

committed

6d99eba

Navigation Menu

Repository navigation

feat(Classes/Hierarchy): nondeterministic exponential time hierarchy by lazy diagonalization (#1539 M2) - #2074

feat(Classes/Hierarchy): nondeterministic exponential time hierarchy by lazy diagonalization (#1539 M2)#2074
SamuelSchlesinger merged 15 commits into
mainfrom
claude/ntime-exp-hierarchy-1539

Commits on Oct 31, 2026

feat(Classes/Time): explicit-time verifier characterization of NTIME (#1572)

Merge origin/main into claude/ntime-hierarchy

feat(Classes/Hierarchy): coarse nondeterministic time hierarchy by lazy diagonalization (#1572)

refactor(Classes/Space): use the public bounded-existential edges in setOf_exists_mem_PSPACE

doc(Classes/Hierarchy): state the interval cases of the lazy diagonal verifier precisely

Merge origin/main into claude/ntime-exp-hierarchy-1539

feat(Classes/Hierarchy): nondeterministic exponential time hierarchy by lazy diagonalization (#1539 M2)

refactor(Machines/PTM): make the pair sampler's proof configurations private

Merge branch 'claude/ntime-hierarchy' into claude/ntime-lazy-diagonal

Merge remote-tracking branch 'origin/main' into claude/ntime-lazy-diagonal

refactor(BigO/Bounds): make ComputableInO.mono_time public

Merge branch 'claude/ntime-lazy-diagonal' into claude/ntime-exp-hierarchy-1539

refactor(Classes/Hierarchy): use the public ComputableInO.mono_time

refactor(Machines/Complexity): share the exponential resource rules of the hierarchy proof

Merge origin/main into claude/ntime-exp-hierarchy-1539