Author:
Courtois Nicolas,Goubin Louis,Meier Willi,Tacier Jean-Daniel
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Lect Notes Comput Sci;N. Courtois,2000
2. J.-Ch. Faugère, A new efficient algorithm for computing Gröbner bases (F 4), Journal of Pure and Applied Algebra 139 (1999), pp. 61–88. See http://www.elsevier.com/locate/jpaa .
3. M. R. Garey, D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, W. H. Freeman and Company, New York, 1979.
4. Lect Notes Comput Sci;A. Kipnis,1999
5. Lect Notes Comput Sci;A. Kipnis,1998
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献