scientific article; zbMATH DE number 3628385
From MaRDI portal
Publication:4190138
zbMath0404.68049MaRDI QIDQ4190138
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chinese Remainder TheoremFast Fourier TransformIterationsComputational ComplexityMatrix MultiplicationAlgebraic GeometryArithmetic ComplexityRational FunctionsModular ArithmeticParallel ComputationsEvaluation of Bilinear FormsInfinite ComputationsInterpolation Of Polynomials
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Numerical methods for trigonometric approximation and interpolation (65T40) Software, source code, etc. for problems pertaining to number theory (11-04) Elementary number theory (11A99) Forms and linear algebraic groups (11E99) Polynomials and matrices (11C99) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (only showing first 100 items - show all)
Oracle computations in parallel numerical linear algebra ⋮ The complexity of evaluating interpolation polynomials ⋮ On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems ⋮ Polynomial division and its computational complexity ⋮ Algebraic complexity of computing polynomial zeros ⋮ Sequential and parallel complexity of approximate evaluation of polynomial zeros ⋮ Time-space efficient algorithms for computing convolutions and related problems ⋮ Complexity of parallel matrix computations ⋮ On the worst-case arithmetic complexity of approximating zeros of polynomials ⋮ A fast algorithm for the discrete Laplace transformation ⋮ The trace invariant and matrix inversion ⋮ A logarithmic Boolean time algorithm for parallel polynomial division ⋮ Algebraic and numerical techniques for the computation of matrix determinants ⋮ Feasible arithmetic computations: Valiant's hypothesis ⋮ A class of algorithms which require nonlinear time to maintain disjoint sets ⋮ The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms ⋮ On the order of approximation in approximative triadic decompositions of tensors ⋮ Algorithms, complexity and discreteness criteria in \(PSL(2,C)\) ⋮ Lower bounds for polynomial evaluation and interpolation problems ⋮ Size-depth tradeoff in non-monotone Boolean formulae ⋮ Stability of fast algorithms for matrix multiplication ⋮ Time-space tradeoffs for computing functions, using connectivity properties of their circuits ⋮ Multiplicative complexity of some rational functions ⋮ Negation can be exponentially powerful ⋮ On the complexity of computing bilinear forms with \(\{0,1\}\) constants ⋮ The complexity of basic complex operations ⋮ On the control of structural models ⋮ The bit-operation complexity of matrix multiplication and of all pair shortest path problem ⋮ On efficient computation of the coefficients of some polynomials with applications to some enumeration problems ⋮ Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring ⋮ On the algorithmic complexity of associative algebras ⋮ New combinations of methods for the acceleration of matrix multiplication ⋮ How many polynomials can be approximated faster than they can be evaluated? ⋮ On the additive complexity of polynomials ⋮ The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities ⋮ Parallelism and fast solution of linear systems ⋮ On the deterministic complexity of factoring polynomials over finite fields ⋮ On the complexity of simplifying quadratic forms ⋮ A complexity theory of efficient parallel algorithms ⋮ Computing cube roots when a fast square root is available ⋮ The computational complexity of a set of quadratic functions ⋮ Fast evaluation and interpolation at the Chebyshev sets of points ⋮ Efficient parallel algorithms for linear recurrence computation ⋮ The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic ⋮ Computing lower bounds on tensor rank over finite fields ⋮ Computing multivariate polynomials in parallel ⋮ Fast matrix multiplication without APA-algorithms ⋮ The complexity of partial derivatives ⋮ Invariant and geometric aspects of algebraic complexity theory. I ⋮ The parallel complexity of function approximation ⋮ On practical algorithms for accelerated matrix multiplication ⋮ Parallel information-based complexity ⋮ On the evaluation of the eigenvalues of a banded Toeplitz block matrix ⋮ A parallel algorithm for solving the inverse scattering moment problem ⋮ An improved parallel algorithm for computing the generalized inverse \(A^ +\) ⋮ Test complexity of generic polynomials ⋮ Trade-offs between communication and space ⋮ Polynomial division with a remainder by means of evaluation and interpolation ⋮ Parametrization of Newton's iteration for computations with structured matrices and applications ⋮ Polynomial evaluation over finite fields: new algorithms and complexity bounds ⋮ On the computational complexity of integral equations ⋮ Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation ⋮ A multiprecise integer arithmetic package ⋮ On the additive complexity of specific polynomials ⋮ Commutativity, non-commutativity, and bilinearity ⋮ Graph-theoretic properties in computational complexity ⋮ A backward automatic differentiation framework for reservoir simulation ⋮ Parallel direct linear system solvers - a survey ⋮ The complexity of vector-products ⋮ Evaluation of polynomials with super-preconditioning ⋮ An improved parallel processor bound in fast matrix inversion ⋮ \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication ⋮ On the optimal computation of a set of symmetric and persymmetric bilinear forms ⋮ Computational complexity of one-step methods for a scalar autonomous differential equation ⋮ On the number of active *-operations needed to compute the discrete Fourier transform ⋮ Product rules for the displacement of near-Toeplitz matrices ⋮ Planar acyclic computation ⋮ Functional decomposition of polynomials: the tame case ⋮ Fast rectangular matrix multiplication and applications ⋮ Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)] ⋮ Reduced complexity evaluation of hypergeometric functions ⋮ On the representation of rational functions of bounded complexity ⋮ Remarks on complexity of polynomial and special matrix computations ⋮ Lower bounds on the depth of monotone arithmetic computations ⋮ Algorithms for fast convolutions on motion groups ⋮ Rank and optimal computation of generic tensors ⋮ Upper bounds on the complexity of solving systems of linear equations ⋮ Lower bounds in algebraic computational complexity ⋮ Inversion formulas and fast algorithms for Löwner-Vandermonde matrices ⋮ Fast algorithms for the characteristic polynomial ⋮ The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations ⋮ Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation ⋮ Fuzzy weighted average: An improved algorithm ⋮ Typical tensorial rank ⋮ An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution ⋮ Multiplication is the easiest nontrivial arithmetic function ⋮ Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity ⋮ Improved lower bounds for some matrix multiplication problems ⋮ The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms ⋮ On the algebraic complexity of rational iteration procedures
This page was built for publication:
