Polynomial time algorithms for modules over finite dimensional algebras
暂无分享,去创建一个
Marek Karpinski | Gábor Ivanyos | Alexander L. Chistov | M. Karpinski | A. Chistov | G. Ivanyos | Marek Karpinski
[1] Lajos Rónyai,et al. Computing irreducible representations of finite groups , 1990 .
[2] Peter J. Weinberger,et al. Factoring Polynomials Over Algebraic Number Fields , 1976, TOMS.
[3] Derek F. Holt,et al. Testing modules for irreducibility , 1994, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.
[4] Lajos Rónyai,et al. Polynomial time solutions of some problems of computational algebra , 1985, STOC '85.
[5] Lajos Rónyai. A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q , 1994, J. Algorithms.
[6] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[7] Lajos Rónyai,et al. Zero Divisors in Quaternion Algebras , 1988, J. Algorithms.
[8] Marek Karpinski,et al. Polynomial Time Decomposition of Modules over Algebras and its Application , 1996 .
[9] Lajos Rónyai,et al. Computing irreducible representations of finite groups , 1989, 30th Annual Symposium on Foundations of Computer Science.
[10] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .
[11] Gábor Ivanyos,et al. Finding the radical of an algebra of linear transformations , 1997 .
[12] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[13] Lajos Rónyai,et al. Computing Levi Decompositions in Lie algebras , 1997, Applicable Algebra in Engineering, Communication and Computing.
[14] Lajos Rónyai,et al. Computing the Structure of Finite Algebras , 1990, J. Symb. Comput..