Adversary lower bound for the k-sum problem
Authors:
Open Access
- 9 January 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 323-328
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Learning-Graph-Based Quantum Algorithm for k-Distinctness2012
- Quantum Query Complexity of State Conversion2011
- Negative weights make adversaries stronger2007
- Quantum Walk Algorithm for Element DistinctnessSIAM Journal on Computing, 2007
- On the power of Ambainis lower boundsTheoretical Computer Science, 2005
- Quantum lower bounds for the collision and the element distinctness problemsJournal of the ACM, 2004
- Complexity measures and decision tree complexity: a surveyTheoretical Computer Science, 2002
- Quantum Lower Bounds by Quantum ArgumentsJournal of Computer and System Sciences, 2002
- Quantum lower bounds by polynomialsJournal of the ACM, 2001