Bilinear mincing rank

DOI10.1016/0304-3975(88)90130-2zbMath0664.68037OpenAlexW1967364204MaRDI QIDQ1115593

Edouard G. Belaga

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90130-2

zbMATH Keywords

bilinear formslower bound on bilinear circuit sizemincing rank

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) General binary quadratic forms (11E16)

Cites Work

• Constructive universal algebra: An introduction
• How to multiply matrices faster
• Lectures on the complexity of bilinear problems
• Through the mincing machine with a Boolean layer cake: nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving
• Relative bilinear complexity and matrix multiplication.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bilinear mincing rank