Pages that link to "Item:Q4625661"
From MaRDI portal
The following pages link to Settling the Query Complexity of Non-adaptive Junta Testing (Q4625661):
Displaying 7 items.
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- A lower bound for testing juntas (Q2390270) (← links)
- Quantum and classical query complexities for generalized Deutsch-Jozsa problems (Q2677211) (← links)
- Testing Boolean Functions Properties (Q5025054) (← links)
- (Q5414625) (← links)
- Approximating the distance to monotonicity of Boolean functions (Q6074683) (← links)
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)