Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference28 articles.
1. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, Sorting in linear time?, inProc. 27th STOC 1995, pp. 427–436.
2. M. Bn-Or, Lower bound for algebraic computation trees, inSTOC 1983, pp. 80–86.
3. N. H. Bshouty, Euclid's GCD algorithm is not optimal, manuscript, 1990.
4. Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains;Bshouty,1989
5. On the complexity of functions for random access machines;Bshouty;J. Assoc. Comput. Mach.,1993