Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference42 articles.
1. Buchberger B (1985) Gröbner bases: an algorithmic method in polynomial ideal theory. In: Bose NK et al. (eds) Multidimensional System Theory. Reidel, Dordrecht, pp 374–383
2. Chistov AL (1986) Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time. J Sov Math 34(4): 1838–1882
3. Chistov AL, Grigoriev D (1983) Subexponential-time solving systems of algebraic equations, I and II, LOMI Preprint, Leningrad, E-9-83, E-10-83
4. Chistov A, Grigoriev D (1984) Complexity of quantifier elimination in the theory of algebraically closed fields. LNCS 176: 17–31
5. Chistov A, Fournier H, Gurvits L, Koiran P (2003) Vandermonde matrices, NP-completeness, and transversal subspaces. Found Comput Math 3(4): 421–427
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献