algorithms-optimization / Analysis of algorithms

Worst-Case Complexity of Shellsort with Tokuda's Gap Sequence

a lower bound for Tokuda's sequence; the general Shellsort complexity question stays open

15Significance / 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

a lower bound for Tokuda's sequence; the general Shellsort complexity question stays open

a lower bound for Tokuda's sequence; the general Shellsort complexity question stays open

Recorded attempts

Evidence graph

Connected research record

Worst-Case Complexity of Shellsort with Tokuda's Gap Sequence — Mathematical Frontier Network