Hans F. de Groote

According to our database, Hans F. de Groote authored at least 8 papers between 1975 and 1987.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1987

On the Complexity of Lie Algebras.

Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt

Proceedings of the Fundamentals of Computation Theory, 1987

Lectures on the Complexity of Bilinear Problems

Hans F. de Groote

Lecture Notes in Computer Science 245, Springer, ISBN: 3-540-17205-X, 1987

1985

A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras.

Hans F. de Groote, Joos Heintz

Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985

1983

Characterization of Division Algebras of Minimal Rank and the Structure of Their Algorithm Varieties.

Hans F. de Groote

SIAM J. Comput., 1983

1978

On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. III. Optimal Algorithms for the Computation of xy and xy where x, y in M2(K).

Hans F. de Groote

Theor. Comput. Sci., 1978

On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. II. Optimal Algorithms for 2x2-Matrix Multiplication.

Hans F. de Groote

Theor. Comput. Sci., 1978

On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings I. The Isotropy Group of a Bilinear Mapping.

Hans F. de Groote

Theor. Comput. Sci., 1978

1975

On the Complexity of Quaternion Multiplication.

Hans F. de Groote

Inf. Process. Lett., 1975