Pages that link to "Item:Q5415538"
From MaRDI portal
The following pages link to From query complexity to computational complexity (Q5415538):
Displaying 14 items.
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Approximate Query Complexity (Q2947556) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- On the Computational Power of Querying the History (Q3634005) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- (Q5874464) (← links)
- The query complexity of certification (Q6083517) (← links)