The following pages link to (Q4331740):
Displaying 50 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- The secant line variety to the varieties of reducible plane curves (Q268201) (← links)
- Quiz games as a model for information hiding (Q272185) (← links)
- Computing the Tutte polynomial of Archimedean tilings (Q279654) (← links)
- On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
- Learning unions of high-dimensional boxes over the reals (Q294744) (← links)
- A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
- On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
- Even faster integer multiplication (Q306687) (← links)
- Fast Möbius inversion in semimodular lattices and ER-labelable posets (Q311532) (← links)
- A short proof for the open quadrant problem (Q321277) (← links)
- On sunflowers and matrix multiplication (Q354642) (← links)
- A smooth surface of tame representation type (Q357419) (← links)
- Equations for secant varieties of Veronese and other varieties (Q361920) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Optimal algorithms of Gram-Schmidt type (Q393367) (← links)
- Tensor rank: matching polynomials and Schur rings (Q404298) (← links)
- The expected characteristic and permanental polynomials of the random Gram matrix (Q405292) (← links)
- A comparison of different notions of ranks of symmetric tensors (Q405941) (← links)
- Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- An asymptotic bound for secant varieties of Segre varieties (Q467138) (← links)
- Sparse bivariate polynomial factorization (Q477285) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- A simple and fast online power series multiplication and its analysis (Q492037) (← links)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- A new faster algorithm for factoring skew polynomials over finite fields (Q507150) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Fundamental invariants of orbit closures (Q517074) (← links)
- Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- Even partitions in plethysms. (Q536182) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Nonvanishing of Kronecker coefficients for rectangular shapes. (Q549219) (← links)
- Generating fast Fourier transforms of solvable groups (Q597054) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Symmetric tensor decomposition (Q603116) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- On the dimension of higher secant varieties of Segre varieties \(\mathbb P^n \times \cdots \times \mathbb P^n\) (Q626747) (← links)
- Constructive homomorphisms for classical groups. (Q629346) (← links)
- The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation (Q630612) (← links)
- Dynamic normal forms and dynamic characteristic polynomial (Q633626) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- On the generic and typical ranks of 3-tensors (Q649550) (← links)
- Higher secant varieties of \(\mathbb P^n \times \mathbb P^n\) embedded in bi-degree \((1,d)\) (Q649850) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
