scientific article; zbMATH DE number 3628385
From MaRDI portal
Publication:4190138
Algebraic GeometryArithmetic ComplexityChinese Remainder TheoremComputational ComplexityEvaluation of Bilinear FormsFast Fourier TransformInfinite ComputationsInterpolation Of PolynomialsIterationsMatrix MultiplicationModular ArithmeticParallel ComputationsRational Functions
Complexity of computation (including implicit computational complexity) (03D15) Software, source code, etc. for problems pertaining to number theory (11-04) Elementary number theory (11A99) Polynomials and matrices (11C99) Forms and linear algebraic groups (11E99) Software, source code, etc. for problems pertaining to field theory (12-04) Numerical methods for trigonometric approximation and interpolation (65T40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25)
Cited in
(only showing first 100 items - show all)- Rank and optimal computation of generic tensors
- Upper bounds on the complexity of solving systems of linear equations
- Lower bounds in algebraic computational complexity
- Fast algorithms for the characteristic polynomial
- 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
- Improved lower bounds for some matrix multiplication problems
- The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms
- 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
- Feasible arithmetic computations: Valiant's hypothesis
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
- On the order of approximation in approximative triadic decompositions of tensors
- 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
- On the complexity of simplifying quadratic forms
- Computing cube roots when a fast square root is available
- The computational complexity of a set of quadratic functions
- 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
- On the computational complexity of integral equations
- On the additive complexity of specific polynomials
- Commutativity, non-commutativity, and bilinearity
- Graph-theoretic properties in computational complexity
- 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
- Fast rectangular matrix multiplication and applications
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Lower bounds on the depth of monotone arithmetic computations
- Inversion formulas and fast algorithms for Löwner-Vandermonde matrices
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
- Fuzzy weighted average: An improved algorithm
- Oracle computations in parallel numerical linear algebra
- Algebraic and numerical techniques for the computation of matrix determinants
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
- Lower bounds for polynomial evaluation and interpolation problems
- Algorithms for fast convolutions on motion groups
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
- Reduced complexity evaluation of hypergeometric functions
- On the representation of rational functions of bounded complexity
- Remarks on complexity of polynomial and special matrix computations
- Fast and efficient parallel solution of dense linear systems
- A note on the power of integer division
- Probing the arrangement of hyperplanes
- On designing optimal parallel triangular solvers.
- Time-space tradeoffs in algebraic complexity theory
- A fast algorithm for computing the number of magic series
- Piecewise algebraic functions
- Computing Frobenius maps and factoring polynomials
- Efficient sampling methods for discrete distributions
- Fast linear algebra is stable
- Efficient parallel factorization and solution of structured and unstructured linear systems
- An algorithm for modular exponentiation.
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190138)
