On the complexity of simplifying quadratic forms

DOI10.1016/0020-0190(81)90017-XMaRDI QIDQ1157964zbMATH OpenOpenAlexFDO

Authors 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

algebraic complexitymonotone computationsNP completenessstraight- line program

Mathematics Subject Classification ID

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

Cites work

• Fast Parallel Matrix Inversion Algorithms
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• scientific article; zbMATH DE number 3269388 (Why is no real title available?)
• On the complexity of computing bilinear forms with \(\{0,1\}\) constants
• On the complexity of simplifying quadratic forms
• The Computational Complexity of Continued Fractions

Cited in

(1)

• On the complexity of simplifying quadratic forms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157964)