On the complexity of simplifying quadratic forms

DOI10.1016/0020-0190(81)90017-XzbMath0471.68024OpenAlexW2038566461MaRDI QIDQ1157964

Marc Snir

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90017-x

zbMATH Keywords

monotone computationsalgebraic complexityNP completenessstraight- line program

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical linear algebra (65F99)

Related Items (1)

On the complexity of simplifying quadratic forms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of computing bilinear forms with \(\{0,1\}\) constants
• On the complexity of simplifying quadratic forms
• The Computational Complexity of Continued Fractions
• Fast Parallel Matrix Inversion Algorithms

This page was built for publication: On the complexity of simplifying quadratic forms