Searching Monotone Multi-dimensional Arrays
Abstract
In this paper we investigate the problem of searching monotone multi-dimensional arrays. We generalize Linial and Saks' search algorithm LS1 for monotone 3-dimensional arrays to d-dimensions with d≥ 4. Our new search algorithm is asymptotically optimal for d=4.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.