Valiant's model and the cost of computing integers
From MaRDI portal
Publication:1766818
DOI10.1007/s00037-004-0186-2zbMath1061.68062OpenAlexW1991614107MaRDI QIDQ1766818
Publication date: 1 March 2005
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-004-0186-2
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Binary determinantal complexity ⋮ Counting arithmetic formulas ⋮ Log-Concavity and Lower Bounds for Arithmetic Circuits ⋮ Some integer formula encodings and related algorithms ⋮ Sparse multivariate polynomial interpolation on the basis of Schubert polynomials ⋮ Interpolation in Valiant's theory ⋮ On Faster Integer Calculations Using Non-arithmetic Primitives ⋮ Semidefinite programming and arithmetic circuit evaluation ⋮ On the Arithmetic Complexity of Euler Function ⋮ Characterizing Valiant's algebraic complexity classes ⋮ Algebraic Complexity Classes
