Polynomial time algorithms for modules over finite dimensional algebras

Authors:
Alexander Chistov;Gábor Ivanyos;Marek Karpinski
Affiliations:
St. Petersburg Institute for Informatics and Automation of the Academy of Sciences of Russia, 14th line 39, St. Petersburg 199178, Russia;Computer and Automation Institute, Hungarian Academy of Sciences, Lágymányosi u. 11, H-1111 Budapest, Hungary;Department of Computer Science, University of Bonn, 53117 Bonn and International Computer Science Institute, Berkeley, California
Venue:
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Year:
1997

Polynomial time solutions of some problems of computational algebra

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Zero divisers in quaternion algebras

Journal of Algorithms
Computing the structure of finite algebras

Journal of Symbolic Computation - Special issue on computational algebraic complexity
A deterministic method for computing splitting elements in simple algebras over Q

Journal of Algorithms
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Polynomial Time Decomposition of Modules over Algebras and its Application

Polynomial Time Decomposition of Modules over Algebras and its Application

Constructing endomorphism rings via duals

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Classical deterministic complexity of Edmonds' Problem and quantum entanglement

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Classical complexity and quantum entanglement

Journal of Computer and System Sciences - Special issue: STOC 2003
Deterministic Polynomial Time Algorithms for Matrix Completion Problems

SIAM Journal on Computing
Pebble games with algebraic rules

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The Graph Isomorphism Problem and approximate categories

Journal of Symbolic Computation

Hi-index	0.00