Pages that link to "Item:Q5002725"
From MaRDI portal
The following pages link to On the probe complexity of local computation algorithms (Q5002725):
Displaying 10 items.
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Sublinear graph augmentation for fast query implementation (Q1757769) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- Input locality and hardness amplification (Q1946597) (← links)
- Constant-Time Local Computation Algorithms (Q2788995) (← links)
- The communication complexity of local search (Q5212806) (← links)
- Automata, Languages and Programming (Q5716844) (← links)
- A Local Criterion for Polynomial-Time Stratified Computations (Q5747634) (← links)
- (Q5875699) (← links)