An Algorithm for the Computation of Linear Forms

DOI10.1137/0203011MaRDI QIDQ4042652zbMATH OpenOpenAlexFDO

Authors John Savage

Publication date 1974

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0203011

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(16)

• Lower bounds in algebraic computational complexity
• Decomposition of graphs and monotone formula size of homogeneous functions
• On monotone simulations on nonmonotone networks
• On the additive complexity of polynomials
• Additive complexity in directed computations
• Complexity measures and hierarchies for the evaluation of integers and polynomials
• An \(\Omega((n/lg\,n)^{1/2})\) lower bound on the number of additions necessary to compute 0-1 polynomials over the ring of integer polynomials
• Lower bounds for the complexity of polynomials
• Complexity of additive computations of systems of linear forms
• On the number of ANDs versus the number of ORs in monotone Boolean circuits
• Lower bounds for dynamic algebraic problems
• Logic minimization techniques with applications to cryptology
• On sets of linear forms of maximal complexity
• Regular language constrained sequence alignment revisited
• Multi-lender coalitions in costly state verification models
• The Mailman algorithm: a note on matrix-vector multiplication

This page was built for publication: An Algorithm for the Computation of Linear Forms

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