scientific article; zbMATH DE number 976329
From MaRDI portal
Publication:4331740
Number-theoretic algorithms; complexity (11Y16) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(only showing first 100 items - show all)- Generic and typical ranks of multi-way arrays
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Interpolation of polynomials given by straight-line programs
- Deformation techniques for sparse systems
- Evaluation techniques for zero-dimensional primary decomposition
- Semisimple algebras of almost minimal rank over the reals
- Fast conversion algorithms for orthogonal polynomials
- Invariant and geometric aspects of algebraic complexity theory. I
- Test complexity of generic polynomials
- Fast rectangular matrix multiplication and applications
- Algebraic complexity theory. I: An introduction
- On the complexity of the multiplication of matrices of small formats
- The complexity of bivariate power series arithmetic.
- Matrix methods. An introduction to algebraic complexity
- A characterization of degenerate tridimensional tensors.
- Efficient decomposition of separable algebras.
- On the algebraic complexity of some families of coloured Tutte polynomials
- On the rigidity of Vandermonde matrices
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
- Lower bounds for some decision problems over \(C\)
- Variations on computing reciprocals of power series
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
- Balancing bounded treewidth circuits
- Ulrich complexity
- Sparse resultants and straight-line programs
- Tensor rank is not multiplicative under the tensor product
- Multiplicative complexity of vector valued Boolean functions
- Plethysm and fast matrix multiplication
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Separation of variables and the computation of Fourier transforms on finite groups. II
- On the bit complexity of polynomial system solving
- Complexity classes and completeness in algebraic geometry
- Typical and admissible ranks over fields
- Inverse linear difference operators
- On the complexity of the Lickteig-Roy subresultant algorithm
- Polynomial bounds for invariant functions separating orbits
- Complexity of multiplication in commutative group algebras over fields of characteristic 0
- Improved algorithms for computing determinants and resultants
- Essentially optimal computation of the inverse of generic polynomial matrices
- Beyond the Alder-Strassen bound.
- The efficient computation of Fourier transforms on semisimple algebras
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- Lower bounds for dynamic algebraic problems
- Ranks of tensors, secant varieties of Segre varieties and fat points
- Fast computation of discrete invariants associated to a differential rational mapping
- Ranks of tensors and a generalization of secant varieties
- About tracing problems in dynamic geometry
- Efficient evaluation of specific queries in constraint databases
- Small space analogues of Valiant's classes and the limitations of skew formulas
- Time-space tradeoffs in algebraic complexity theory
- Deformation techniques for efficient polynomial equation solving.
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Cook's versus Valiant's hypothesis
- Computational bounds for doing harmonic analysis on permutation modules of finite groups
- Conic stability of polynomials and positive maps
- Fast computation of generic bivariate resultants
- On the complexity of computing Kronecker coefficients
- On Bézout inequalities for non-homogeneous polynomial ideals
- Subquadratic-time algorithms for normal bases
- Lower bounds for matrix factorization
- Identifiability of rank-3 tensors
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- Rank and border rank of Kronecker powers of tensors and Strassen's laser method
- The geometries of Jordan nets and Jordan webs
- Almost all subgeneric third-order Chow decompositions are identifiable
- Newton-type methods for simultaneous matrix diagonalization
- Hermitian K-theory via oriented Gorenstein algebras
- The tensor rank of semifields of order 16 and 81
- Computing zero-dimensional tropical varieties via projections
- Non-minimum tensor rank Gabidulin codes
- The G-stable rank for tensors and the cap set problem
- Computing Riemann-Roch spaces via Puiseux expansions
- An introduction to the computational complexity of matrix multiplication
- Directed evaluation
- On \(\epsilon\)-sensitive monotone computations
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Towards a geometric approach to Strassen's asymptotic rank conjecture
- Kähler differentials for fat point schemes in \(\mathbb{P}^1\times\mathbb{P}^1\)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Elimination for generic sparse polynomial systems
- Intrinsic complexity estimates in polynomial optimization
- Constant-time sorting
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- Homotopy techniques for tensor decomposition and perfect identifiability
- On symmetries of tensor decompositions for the commutator of 2 2 matrices
- Grothendieck constant is norm of Strassen matrix multiplication tensor
- The Hitchhiker guide to: secant varieties and tensor decomposition
- Accelerated tower arithmetic
- Degeneracy loci and polynomial equation solving
- A complexity theory of constructible functions and sheaves
- 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\)
- Geometric complexity theory: an introduction for geometers
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Cancellation-free circuits in unbounded and bounded depth
- On the number of points of algebraic sets over finite fields
- Unifying known lower bounds via geometric complexity theory
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)
