The computational complexity of a set of quadratic functions

DOI10.1016/0022-0000(82)90049-6zbMath0484.68033OpenAlexW1965230165MaRDI QIDQ1163861

Joseph F. Ja'Ja'

Publication date: 1982

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(82)90049-6

zbMATH Keywords

bilinear formscomplexity theoryarithmetic complexitypair of quadratic functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

A lower bound for the multiplication of polynomials modulo a polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimum computation of p bilinear forms
• On the optimal evaluation of a set of bilinear forms
• Gaussian elimination is not optimal
• Optimal Evaluation of Pairs of Bilinear Forms
• On the Complexity of Bilinear Forms with Commutativity
• On the number of multiplications necessary to compute certain functions

This page was built for publication: The computational complexity of a set of quadratic functions