An Algorithm for the Computation of Linear Forms
From MaRDI portal
Publication:4042652
DOI10.1137/0203011zbMath0291.68015OpenAlexW2038999728MaRDI QIDQ4042652
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
Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Logic minimization techniques with applications to cryptology ⋮ On monotone simulations on nonmonotone networks ⋮ On sets of linear forms of maximal complexity ⋮ On the additive complexity of polynomials ⋮ Additive complexity in directed computations ⋮ Multi-lender coalitions in costly state verification models ⋮ Regular Language Constrained Sequence Alignment Revisited ⋮ The Mailman algorithm: a note on matrix-vector multiplication ⋮ 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 in algebraic computational complexity ⋮ Lower bounds for dynamic algebraic problems ⋮ Decomposition of graphs and monotone formula size of homogeneous functions
