Pages that link to "Item:Q2986881"
From MaRDI portal
The following pages link to Adversary lower bound for the k-sum problem (Q2986881):
Displaying 13 items.
- On the power of non-adaptive learning graphs (Q488054) (← links)
- Attacks on beyond-birthday-bound MACs in the quantum setting (Q2118560) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- (Q2830865) (← links)
- (Q4637977) (← links)
- (Q5089146) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems (Q5889069) (← links)
- Improved quantum algorithms for the k-XOR problem (Q6618596) (← links)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)
