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)

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
Relaxed Hensel lifting of triangular sets
On the dimension of higher secant varieties of Segre varieties $\mathbb P^n \times \cdots \times \mathbb P^n$
The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation
Barriers for rank methods in arithmetic complexity
Efficient decomposition of separable algebras.
On the complexity of matrix reduction over finite fields
Symmetry transformations for square sliced three-way arrays, with applications to their typical rank
Generic and typical ranks of multi-way arrays
Dynamic normal forms and dynamic characteristic polynomial
A characterization of degenerate tridimensional tensors.
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
Dynamic matrix rank
Lifting and recombination techniques for absolute factorization
A simple and fast online power series multiplication and its analysis
On the tensor rank of multiplication in any extension of $\mathbb F_2$
Improved dense multivariate polynomial factorization algorithms
Subtraction-free complexity, cluster transformations, and spanning trees
Ranks of tensors, secant varieties of Segre varieties and fat points
Condition length and complexity for the solution of polynomial systems
A new faster algorithm for factoring skew polynomials over finite fields
Efficient computation of the characteristic polynomial of a threshold graph
On the complexity of the multiplication of matrices of small formats
Efficient computation of the characteristic polynomial of a tree and related tasks
Optimization techniques for small matrix multiplication
Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
Fundamental invariants of orbit closures
Lower bounds for dynamic algebraic problems
Universality theorems for inscribed polytopes and Delaunay triangulations
Cook's versus Valiant's hypothesis
On bilinear complexity of multiplication of $m\times 2$ and $2\times 2$ matrices
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

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)