Author:
Babai László,Just Bettina,Meyer auf der Heide Friedhelm
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference8 articles.
1. Lower bounds for algebraic computation trees;Ben Or,1983
2. A lower bound of 12n2 on linear search programs for the knapsack problem;Dobkin;J. Comput. Systems Sci.,1978
3. Polynomial time algorithms for finding integer relations among real numbers;Hastad,1986
4. A lower bound for the knapsack problem on random access machines;Klein;Acta Inform.,1983
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献