The following pages link to (Q4331740):
Displaying 50 items.
- Fast monotone summation over disjoint sets (Q2446070) (← links)
- Inequalities for the ranks of multipartite quantum states (Q2451669) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Computing multihomogeneous resultants using straight-line programs (Q2457419) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- A modular branching rule for the generalized symmetric groups. (Q2460825) (← links)
- Fast linear algebra is stable (Q2461610) (← links)
- On the complexity of matrix reduction over finite fields (Q2467342) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- Ideals of varieties parameterized by certain symmetric tensors (Q2477653) (← links)
- Generalized means of jurors' competencies and marginal changes of jury's size (Q2485458) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- On the complexity of the resolvent representation of some prime differential ideals (Q2496182) (← links)
- Higher secant varieties of the Segre varieties \(\mathbb P^1\times\dots\times\mathbb P^1\) (Q2570681) (← links)
- Rigidity and polynomial invariants of convex polytopes (Q2572640) (← links)
- There is no efficient reverse derivation mode for discrete derivatives (Q2576878) (← links)
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. (Q2577534) (← links)
- Algebraic diagonals and walks: algorithms, bounds, complexity (Q2628311) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
- Computing generators of the ideal of a smooth affine algebraic variety (Q2643543) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Algorithmic classification of noncorrelated binary pattern sequences (Q2660318) (← links)
- On the complexity of finding tensor ranks (Q2667353) (← links)
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
- On sets of linear forms of maximal complexity (Q2680709) (← links)
- On the computation of rational solutions of underdetermined systems over a finite field (Q2685068) (← links)
- Weighted slice rank and a minimax correspondence to Strassen's spectra (Q2692138) (← links)
- The equivariant complexity of multiplication in finite field extensions (Q2693365) (← links)
- The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
- Sublinear root detection and new hardness results for sparse polynomials over finite fields (Q2816831) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Upgrading subgroup triple-product-property triples (Q2828201) (← links)
- On the Differential and Full Algebraic Complexities of Operator Matrices Transformations (Q2829987) (← links)
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)
- Inversion Modulo Zero-Dimensional Regular Chains (Q2915000) (← links)
- Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication (Q3010380) (← links)
- How to integrate a polynomial over a simplex (Q3081285) (← links)
- Secant varieties of ℙ¹×⋯×ℙ¹ (𝕟-times) are NOT defective for 𝕟≥5 (Q3085221) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- Non-defectivity of Grassmannians of planes (Q3117193) (← links)
- The Hitting Time of Multiple Random Walks (Q3185674) (← links)
- On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions (Q3295878) (← links)
- CATEGORICAL COMPLEXITY (Q3304647) (← links)
- The border rank of the multiplication of $2\times 2$ matrices is seven (Q3376942) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- Efficient Computation of the Characteristic Polynomial of a Threshold Graph (Q3452551) (← links)
- Geometry and the complexity of matrix multiplication (Q3498865) (← links)
