On The Intractability Of Hilbert's Nullstellensatz And An Algebraic Version Of . .
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. Completeness classes in algebra , 1979, STOC.
[2] W. Brownawell. Bounds for the degrees in the Nullstellensatz , 1987 .
[3] Joos Heintz. On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey , 1987, AAECC.
[4] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .
[5] Joos Heintz,et al. On the Intrinsic Complexity of Elimination Theory , 1993, J. Complex..
[6] Michael Shub,et al. Some Remarks on Bezout’s Theorem and Complexity Theory , 1993 .
[7] Felipe Cucker,et al. Separation of Complexity Classes in Koiran's Weak Model , 1994, Theor. Comput. Sci..