More on noncommutative polynomial identity testing
暂无分享,去创建一个
[1] A. S. Amitsur,et al. Minimal identities for algebras , 1950 .
[2] Noam Nisan,et al. Lower bounds for non-commutative computation , 1991, STOC '91.
[3] Hoeteck Wee,et al. A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes , 2004, APPROX-RANDOM.
[4] Steve Chien,et al. Algebras with polynomial identities and computing the determinant , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[5] Louis Rowen,et al. Polynomial identities in ring theory , 1980 .
[6] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[7] Vesselin Drensky,et al. Polynomial Identity Rings , 2004 .
[8] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[9] Kiyoshi Maruyama,et al. The Parallel Evaluation of Arithmetic Expressions Without Division , 1973, IEEE Transactions on Computers.
[10] Richard P. Brent,et al. The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.
[11] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[12] Ran Raz,et al. Deterministic polynomial identity testing in non-commutative models , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..