scientific article; zbMATH DE number 976329

zbMATH Open1087.68568MaRDI QIDQ4331740FDOQ4331740

Authors: Peter Bürgisser, Michael Clausen, M. Amin Shokrollahi

Publication date: 5 February 1997

Title of this publication is not available (Why is that?)

Recommendations

Algebraic complexity theory. I: An introduction
Geometry and complexity theory
scientific article; zbMATH DE number 4112009
On numerical invariants in algebraic complexity theory

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)

Cited In (only showing first 100 items - show all)

Optimal algorithms of Gram-Schmidt type
Geometry and the complexity of matrix multiplication
Fast rectangular matrix multiplication and applications
A complexity theory of constructible functions and sheaves
Tensor rank: matching polynomials and Schur rings
Title not available (Why is that?)
Secant varieties of Grassmann varieties
A concise proof of the Kronecker polynomial system solver from scratch
Constrained multilinear detection and generalized graph motifs
Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
Nonvanishing of Kronecker coefficients for rectangular shapes.
Interpolation of polynomials given by straight-line programs
Constructive homomorphisms for classical groups.
A comparison of different notions of ranks of symmetric tensors
The expected characteristic and permanental polynomials of the random Gram matrix
On the ideals of secant varieties to certain rational varieties
The secant line variety to the varieties of reducible plane curves
Quiz games as a model for information hiding
Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
Modular composition modulo triangular sets and applications
Fast arithmetics in Artin-Schreier towers over finite fields
Tensors in computations
Computing the Tutte polynomial of Archimedean tilings
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
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
On the complexity of computing Kronecker coefficients
Deformation techniques for sparse systems
A Gröbner free alternative for polynomial system solving
On Faster Integer Calculations Using Non-arithmetic Primitives
Symmetric tensor decomposition
Tight bounds for the multiplicative complexity of symmetric functions
Ranks of tensors and a generalization of secant varieties
Title not available (Why is that?)
On the asymptotic and practical complexity of solving bivariate systems over the reals
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
Faster algorithms for finding and counting subgraphs
On the nuclear norm and the singular value decomposition of tensors
Even faster integer multiplication
Secant varieties of \({\mathbb {P}^1}\times \cdots \times {\mathbb {P}^1} (n\)-times) are not defective for \(n \geq 5\)
Small space analogues of Valiant's classes and the limitations of skew formulas
Simple forms of higher-order linear differential systems and their applications in computing regular solutions
Deformation techniques for efficient polynomial equation solving.
On the ranks and border ranks of symmetric tensors
Rigidity and polynomial invariants of convex polytopes
3-dimensional sundials
Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
Discrete Fourier transform tensors and their ranks
On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
A short proof for the open quadrant problem
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
Equations for secant varieties of Veronese and other varieties
On the complexity of the resolvent representation of some prime differential ideals
Polynomial evaluation and interpolation on special sets of points
Bounded-rank tensors are defined in bounded degree
Generalized polar varieties: geometry and algorithms
Asymptotically fast group operations on Jacobians of general curves
Logic minimization techniques with applications to cryptology
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
Lower complexity bounds for interpolation algorithms
On the rigidity of Vandermonde matrices
Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
A generalization of Spira's theorem and circuits with small segregators or separators
Fast Möbius inversion in semimodular lattices and ER-labelable posets
Beyond the Alder-Strassen bound.
On sunflowers and matrix multiplication
Subquadratic-time factoring of polynomials over finite fields
Integer complexity and well-ordering
Multiplicative complexity of vector valued Boolean functions
How to integrate a polynomial over a simplex
Non-defectivity of Grassmannians of planes
Geometric complexity theory: an introduction for geometers
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
Noncommutative convexity arises from linear matrix inequalities
Induction for secant varieties of Segre varieties
Fast separable factorization and applications
Fast computation of special resultants
On the number of points of algebraic sets over finite fields
Complexity of the Bollobás-Riordan Polynomial
A parametric representation of totally mixed Nash equilibria
Higher secant varieties of the Segre varieties \(\mathbb P^1\times\dots\times\mathbb P^1\)
Computing multihomogeneous resultants using straight-line programs
Change of order for regular chains in positive dimension
Lower bounds for matrix factorization
Lower bounds for matrix factorization
On the bit complexity of polynomial system solving
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Partition arguments in multiparty communication complexity
Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Fast matrix multiplication and its algebraic neighbourhood
The efficient computation of Fourier transforms on the symmetric group
Title not available (Why is that?)
Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
Ideals of varieties parameterized by certain symmetric tensors
Subtracting a best rank-1 approximation may increase tensor rank

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)