Corpus ID: 14422753

Refined Upper and Lower Bounds for 2-SUM

@inproceedings{Chan2004RefinedUA,
  title={Refined Upper and Lower Bounds for 2-SUM},
  author={A. L. Chan and W. Gasarch and C. Kruskal},
  year={2004}
}
We prove upper and lower bounds on the time complexity of solving the 2-SUM problem: given a set of numbers, are there two of them that sum to zero? Our basic models are the linear decision tree and the degree-d algebraic decision tree. Our bounds are more precise than is common for this field and allow us to observe that 2-SUM is strictly harder than sorting in the linear decision tree model. 

References

SHOWING 1-10 OF 22 REFERENCES
Lower bounds for algebraic computation trees
  • M. Ben-Or
  • Computer Science, Mathematics
  • STOC '83
  • 1983
  • 590
  • PDF
Linear decision trees: volume estimates and topological bounds
  • 116
  • PDF
On the complexity of computations under varying sets of primitives
  • 95
  • PDF
Better lower bounds on detecting affine and spherical degeneracies
  • Nir Ailon, B. Chazelle
  • Computer Science
  • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
  • 1993
  • 38
  • PDF
How hard are n2-hard problems?
  • 9
New Lower Bounds for Element Distinctness on a On-Tape Turing Machine
  • 6
The Ford-Johnson Sorting Algorithm Is Not Optimal
  • 26