Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference20 articles.
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. AFIPS Conference Proceedings;B. G. Baumgart,1975
3. M. Ben-Or, Lower bounds for algebraic computation trees,Proc. 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 80–86.
4. E. Dittert and M. J. O'Donnell, Lower bounds for sorting with realistic instruction sets,IEEE Trans. Comput. 34, 4 (1985), pp. 311–317.
5. D. P. Dobkin and R. Lipton, On the complexity of computations under varying sets of primitives,J. Comput. System Sci. 18 (1979), pp. 86–91.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献