Pages that link to "Item:Q3002755"
From MaRDI portal
The following pages link to Quantum lower bound for the collision problem with small range (Q3002755):
Displaying 19 items.
- Quantum collision-finding in non-uniform random functions (Q1644795) (← links)
- Element distinctness revisited (Q1993785) (← links)
- Quantum algorithm for the multicollision problem (Q2006780) (← links)
- Oracle separations between quantum and non-interactive zero-knowledge classes (Q2011030) (← links)
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions (Q2018202) (← links)
- The quantum query complexity of the abelian hidden subgroup problem (Q2373740) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- Quantum adversary lower bound for element distinctness with small range (Q3191147) (← links)
- Quantum lower bounds for the collision and the element distinctness problems (Q3498860) (← links)
- (Q4637977) (← links)
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
- (Q5090392) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
- (Q6176153) (← links)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)