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)

A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
Correction to: ``The complexity of factors of multivariate polynomials
Fast multiplication of matrices over a finitely generated semiring
The complexity of bivariate power series arithmetic.
Title not available (Why is that?)
Generating labeled planar graphs uniformly at random
Most secant varieties of tangential varieties to Veronese varieties are nondefective
Asymptotic tensor rank of graph tensors: beyond matrix multiplication
Conic stability of polynomials and positive maps
Rank and border rank of Kronecker powers of tensors and Strassen's laser method
On the ultimate complexity of factorials
On the complexities of multipoint evaluation and interpolation
Typical and admissible ranks over fields
Pencil-based algorithms for tensor rank decomposition are not stable
The hitting time of multiple random walks
On the complexity of the Lickteig-Roy subresultant algorithm
Variations on computing reciprocals of power series
Modular composition via factorization
Some lower bounds for the complexity of the linear programming feasibility problem over the reals
On the computation of rational solutions of underdetermined systems over a finite field
Homotopy techniques for tensor decomposition and perfect identifiability
The Hitchhiker guide to: secant varieties and tensor decomposition
Tensor surgery and tensor rank
Efficient evaluation of specific queries in constraint databases
Inequalities for the ranks of multipartite quantum states
An introduction to the computational complexity of matrix multiplication
Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
Fast matrix multiplication is stable
Fast computation of a rational point of a variety over a finite field
Fast structured matrix computations: tensor rank and Cohn-Umans method
On sets of linear forms of maximal complexity
On cap sets and the group-theoretic approach to matrix multiplication
Fast computation of discrete invariants associated to a differential rational mapping
Complexity of tropical Schur polynomials
Improved algorithms for computing determinants and resultants
Linear time Fourier transforms of $S_{n-k}$-invariant functions on the symmetric group $S_n$
Semisimple algebras of almost minimal rank over the reals
Invariant and geometric aspects of algebraic complexity theory. I
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Elimination for generic sparse polynomial systems
Categorical complexity
Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
The asymptotic induced matching number of hypergraphs: balanced binary strings
On the complexity of finding tensor ranks
Algebraic complexity classes
Test complexity of generic polynomials
Essentially optimal computation of the inverse of generic polynomial matrices
Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective
Rigid continuation paths II. structured polynomial systems
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
A modular branching rule for the generalized symmetric groups.
Faster sparse multivariate polynomial interpolation of straight-line programs
Threshold arrangements and the knapsack problem
Stability versus speed in a computable algebraic model
Sublinear root detection and new hardness results for sparse polynomials over finite fields
An algorithm for implicit interpolation
Fast systematic encoding of multiplicity codes
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
Tensor decomposition in electronic structure calculations on 3D Cartesian grids
Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
Computability in linear algebra
On the complexity exponent of polynomial system solving
Fast linear algebra is stable
Generating fast Fourier transforms of solvable groups
Polynomial equation solving by lifting procedures for ramified fibers
Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
The border rank of the multiplication of $2\times 2$ matrices is seven
Evaluation techniques for zero-dimensional primary decomposition
$P$ versus $NP$ and geometry
Higher secant varieties of $\mathbb P^n \times \mathbb P^n$ embedded in bi-degree $(1,d)$
Generalized polar varieties and an efficient real elimination.
Computing Fourier transforms and convolutions of $S_{n - 1}$-invariant signals on $S_n$ in time linear in $n$
A probabilistic algorithm to test local algebraic observability in polynomial time
A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
Even partitions in plethysms.
Generalized means of jurors' competencies and marginal changes of jury's size
Fast evaluation of interlace polynomials on graphs of bounded treewidth
An asymptotic bound for secant varieties of Segre varieties
On the algebraic complexity of some families of coloured Tutte polynomials
On sign conditions over real multivariate polynomials
Fast conversion algorithms for orthogonal polynomials
Sparse bivariate polynomial factorization

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)