The following pages link to (Q4331740):
Displaying 50 items.
- Directed evaluation (Q2192677) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
- Towards a geometric approach to Strassen's asymptotic rank conjecture (Q2228323) (← links)
- Kähler differentials for fat point schemes in \(\mathbb{P}^1\times\mathbb{P}^1\) (Q2236793) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- Constant-time sorting (Q2252525) (← links)
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
- Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective (Q2280138) (← links)
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\) (Q2284962) (← links)
- Homotopy techniques for tensor decomposition and perfect identifiability (Q2317007) (← links)
- On symmetries of tensor decompositions for the commutator of \(2 \times 2\) matrices (Q2319833) (← links)
- Grothendieck constant is norm of Strassen matrix multiplication tensor (Q2334621) (← links)
- The Hitchhiker guide to: secant varieties and tensor decomposition (Q2337279) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Degeneracy loci and polynomial equation solving (Q2340506) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- Nontriviality of equations and explicit tensors in \(\mathbb{C}^m \otimes \mathbb{C}^m \otimes \mathbb{C}^m\) of border rank at least \(2m - 2\) (Q2341558) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
- On the number of points of algebraic sets over finite fields (Q2349351) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Generalized finite automata over real and complex numbers (Q2354406) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Generating labeled planar graphs uniformly at random (Q2373725) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- On the number of multiplications needed to invert a monic power series over fields of characteristic two (Q2387412) (← links)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- A note on the gap between rank and border rank (Q2396706) (← links)
- Classification of subspaces in \(\mathbb F^2\otimes \mathbb F^3\) and orbits in \(\mathbb F^2 \otimes \mathbb F^3 \otimes \mathbb F^r\) (Q2397233) (← links)
- Abelian tensors (Q2398420) (← links)
- Lower bounds for the circuit size of partially homogeneous polynomials (Q2405138) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- Fast systematic encoding of multiplicity codes (Q2422714) (← links)
- Tensor surgery and tensor rank (Q2422765) (← links)
- Asymptotic tensor rank of graph tensors: beyond matrix multiplication (Q2422766) (← links)
- On the ideals of secant varieties to certain rational varieties (Q2425422) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Simple forms of higher-order linear differential systems and their applications in computing regular solutions (Q2430021) (← links)
- Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
- On the tensor rank of multiplication in any extension of \(\mathbb F_2\) (Q2431340) (← links)
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time (Q2431341) (← links)
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition (Q2437224) (← links)
- Bounded-rank tensors are defined in bounded degree (Q2443215) (← links)
