Pages that link to "Item:Q5313029"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313029):
Displaying 7 items.
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- Sparse Recovery with Partial Support Knowledge (Q3088079) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- (Q6084405) (← links)
