Membership in Plynomial Ideals over Q Is Exponential Space Complete
暂无分享,去创建一个
[1] L. Csanky,et al. Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..
[2] Oscar H. Ibarra,et al. A Note on the Parallel Complexity of Computing the Rank of Order n Matrices , 1980, Inf. Process. Lett..
[3] Victor Y. Pan,et al. Complexity of Parallel Matrix Computations , 1987, Theor. Comput. Sci..
[4] Fred Richman,et al. Constructive aspects of Noetherian rings , 1974 .
[5] Steven Fortune,et al. Parallelism in random access machines , 1978, STOC.
[6] Dung T. Huynh. The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals , 1986, SIAM J. Comput..
[7] A. Seidenberg. Constructions in algebra , 1974 .
[8] Grete Hermann,et al. Die Frage der endlich vielen Schritte in der Theorie der Polynomideale , 1926 .
[9] A. Meyer,et al. The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .