theoretical-computer-science / Average-case complexity

The Polynomial-Time Low-Degree Conjecture

the construction is probabilistic; an explicit uniformly samplable example remains open

30Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

Research memory

Claims and attempts

Scoped claims

Source authenticated

the construction is probabilistic; an explicit uniformly samplable example remains open

the construction is probabilistic; an explicit uniformly samplable example remains open

Recorded attempts

Evidence graph

Connected research record