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)- Border Rank Nonadditivity for Higher Order Tensors
- On the differential and full algebraic complexities of operator matrices transformations
- The hitting time of multiple random walks
- Tensor decomposition in electronic structure calculations on 3D Cartesian grids
- Ideals of varieties parameterized by certain symmetric tensors
- On the complexity of the Lickteig-Roy subresultant algorithm
- Pencil-based algorithms for tensor rank decomposition are not stable
- A new method to obtain lower bounds for polynomial evaluation
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
- On Bézout inequalities for non-homogeneous polynomial ideals
- Symmetric tensor decomposition
- A Gröbner free alternative for polynomial system solving
- On Faster Integer Calculations Using Non-arithmetic Primitives
- Tight bounds for the multiplicative complexity of symmetric functions
- Subrank and optimal reduction of scalar multiplications to generic tensors
- Subtracting a best rank-1 approximation may increase tensor rank
- Generalizing Frobenius inversion to quaternion matrices
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Ranks of tensors and a generalization of secant varieties
- scientific article; zbMATH DE number 7561763 (Why is no real title available?)
- Rank of a tensor and quantum entanglement
- Computability in linear algebra
- On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication
- Variations on computing reciprocals of power series
- Modular composition via factorization
- scientific article; zbMATH DE number 4112009 (Why is no real title available?)
- On Kolmogorov complexity in the real Turing machine setting
- A note on the use of determinant for proving lower bounds on the size of linear circuits
- Learning unions of high-dimensional boxes over the reals
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals
- Universal points in the asymptotic spectrum of tensors
- Computing generators of the ideal of a smooth affine algebraic variety
- Notions of tensor rank
- Polynomial bounds for invariant functions separating orbits
- Complexity of multiplication in commutative group algebras over fields of characteristic 0
- Lower bounds for the circuit size of partially homogeneous polynomials
- Faster algorithms for finding and counting subgraphs
- The condition number of join decompositions
- On the computation of rational solutions of underdetermined systems over a finite field
- Homotopy techniques for tensor decomposition and perfect identifiability
- On the complexity exponent of polynomial system solving
- The Hitchhiker guide to: secant varieties and tensor decomposition
- On the nuclear norm and the singular value decomposition of tensors
- Even faster integer multiplication
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
- Group-theoretic lower bounds for the complexity of matrix multiplication
- Generating fast Fourier transforms of solvable groups
- Polynomial equation solving by lifting procedures for ramified fibers
- Fast linear algebra is stable
- Tensor surgery and tensor rank
- Efficient evaluation of specific queries in constraint databases
- A normal form algorithm for tensor rank decomposition
- An introduction to the computational complexity of matrix multiplication
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- Secant varieties of \({\mathbb {P}^1}\times \cdots \times {\mathbb {P}^1} (n\)-times) are not defective for \(n \geq 5\)
- Inequalities for the ranks of multipartite quantum states
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- On numerical invariants in algebraic complexity theory
- Chudnovsky-type algorithms over the projective line using generalized evaluation maps
- Constant-time sorting
- A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
- Evaluation techniques for zero-dimensional primary decomposition
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Small space analogues of Valiant's classes and the limitations of skew formulas
- Algorithmic classification of noncorrelated binary pattern sequences
- Fast matrix multiplication is stable
- Simple forms of higher-order linear differential systems and their applications in computing regular solutions
- \(P\) versus \(NP\) and geometry
- The border rank of the multiplication of $2\times 2$ matrices is seven
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
- Higher secant varieties of P^n P^n embedded in bi-degree (1,d)
- On the ranks and border ranks of symmetric tensors
- Deformation techniques for efficient polynomial equation solving.
- 3-dimensional sundials
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Computing zero-dimensional tropical varieties via projections
- Fast computation of a rational point of a variety over a finite field
- Rigidity and polynomial invariants of convex polytopes
- Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
- A Gap in the Subrank of Tensors
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
- Generalized polar varieties and an efficient real elimination.
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Bivariate polynomial reduction and elimination ideal over finite fields
- Logical characterizations of algebraic circuit classes over integral domains
- CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM
- Even partitions in plethysms.
- A short proof for the open quadrant problem
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Non-minimum tensor rank Gabidulin codes
- On matrices with displacement structure: generalized operators and faster algorithms
- Discrete Fourier transform tensors and their ranks
- A probabilistic algorithm to test local algebraic observability in polynomial time
- Equations for secant varieties of Veronese and other varieties
- On sets of linear forms of maximal complexity
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)
