Subject
General Computer Science,Theoretical Computer Science
Reference7 articles.
1. Square rooting is as difficult as multiplication;Alt;Computing,1978
2. On a problem of Grünbaum;Erdös;Canad. Math. Bull.,1972
3. Computers and Intractability;Garey,1979
4. Joseph Fourier—The Man and the Physicist;Herivel,1975
5. NP-complete decision problems for binary quadratics;Manders;J. Comput. System Sci.,1978
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献