scientific article; zbMATH DE number 976329
From MaRDI portal
Publication:4331740
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Number-theoretic algorithms; complexity (11Y16)
Recommendations
Cited in
(only showing first 100 items - show all)- An algorithm for implicit interpolation
- Optimal algorithms of Gram-Schmidt type
- On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
- A note on the gap between rank and border rank
- Multi-experiment parameter identifiability of ODEs and model theory
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- Fast systematic encoding of multiplicity codes
- Correction to: ``The complexity of factors of multivariate polynomials
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Computational bounds for doing harmonic analysis on permutation modules of finite groups
- Fast rectangular matrix multiplication and applications
- On symmetries of tensor decompositions for the commutator of \(2 \times 2\) matrices
- Hermitian \(K\)-theory via oriented Gorenstein algebras
- Partial Degeneration of Tensors
- Geometry and the complexity of matrix multiplication
- A parametric representation of totally mixed Nash equilibria
- Matrix pencils and entanglement classification
- A complexity theory of constructible functions and sheaves
- Complexity of the Bollobás-Riordan Polynomial
- Tensor rank: matching polynomials and Schur rings
- Higher secant varieties of the Segre varieties \(\mathbb P^1\times\dots\times\mathbb P^1\)
- Kähler differentials for fat point schemes in \(\mathbb{P}^1\times\mathbb{P}^1\)
- Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
- Computing multihomogeneous resultants using straight-line programs
- Inversion modulo zero-dimensional regular chains
- Constrained multilinear detection and generalized graph motifs
- A concise proof of the Kronecker polynomial system solver from scratch
- Fast multiplication of matrices over a finitely generated semiring
- Algebraic diagonals and walks: algorithms, bounds, complexity
- Degeneracy loci and polynomial equation solving
- Classification of subspaces in F^2 F^3 and orbits in F^2 F^3 F^r
- Secant varieties of Grassmann varieties
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- scientific article; zbMATH DE number 7689792 (Why is no real title available?)
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Nonvanishing of Kronecker coefficients for rectangular shapes.
- There is no efficient reverse derivation mode for discrete derivatives
- Change of order for regular chains in positive dimension
- Lower bounds for matrix factorization
- A super-quadratic lower bound for depth four arithmetic circuits
- Tensor representation of rank-metric codes
- Lower bounds for some decision problems over \(C\)
- On the tensor rank of the \(3 \times 3\) permanent and determinant
- Constructive homomorphisms for classical groups.
- Certifying zeros of polynomial systems using interval arithmetic
- Interpolation of polynomials given by straight-line programs
- Randomized polynomial-time root counting in prime power rings
- The complexity of bivariate power series arithmetic.
- A comparison of different notions of ranks of symmetric tensors
- The expected characteristic and permanental polynomials of the random Gram matrix
- Lower bounds for matrix factorization
- Three new factors of Fermat numbers
- Semantics, specification logic, and Hoare logic of exact real computation
- Accelerated tower arithmetic
- scientific article; zbMATH DE number 7561544 (Why is no real title available?)
- On the bit complexity of polynomial system solving
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- The secant line variety to the varieties of reducible plane curves
- Quiz games as a model for information hiding
- Fast computation of generic bivariate resultants
- Partition arguments in multiparty communication complexity
- On the ideals of secant varieties to certain rational varieties
- Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity
- scientific article; zbMATH DE number 4092769 (Why is no real title available?)
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- Generating labeled planar graphs uniformly at random
- Modular composition modulo triangular sets and applications
- Fast monotone summation over disjoint sets
- Asymptotic tensor rank of graph tensors: beyond matrix multiplication
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
- Code Generation for Polynomial Multiplication
- Fast arithmetics in Artin-Schreier towers over finite fields
- Most secant varieties of tangential varieties to Veronese varieties are nondefective
- Conic stability of polynomials and positive maps
- On the equivalence between low-rank matrix completion and tensor rank
- On the ultimate complexity of factorials
- On the complexities of multipoint evaluation and interpolation
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Rank and border rank of Kronecker powers of tensors and Strassen's laser method
- Nontriviality of equations and explicit tensors in \(\mathbb{C}^m \otimes \mathbb{C}^m \otimes \mathbb{C}^m\) of border rank at least \(2m - 2\)
- Numerical stability and tensor nuclear norm
- Computing the Tutte polynomial of Archimedean tilings
- Polynomial braid combing
- Tensors in computations
- Typical and admissible ranks over fields
- Fast matrix multiplication and its algebraic neighbourhood
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Matrix methods. An introduction to algebraic complexity
- On the generic and typical ranks of 3-tensors
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Bit-size estimates for triangular sets in positive dimension
- Inverse linear difference operators
- The efficient computation of Fourier transforms on the symmetric group
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- The tensor rank of semifields of order 16 and 81
- Classifying entanglement by algebraic geometry
- Deformation techniques for sparse systems
- On the complexity of computing Kronecker coefficients
- Tensor Codes and Their Invariants
- scientific article; zbMATH DE number 3913670 (Why is no real title available?)
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 Q4331740)
