The following pages link to (Q4331740):
Displaying 50 items.
- 3-dimensional sundials (Q657407) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- Computability in linear algebra (Q703545) (← links)
- On the ultimate complexity of factorials (Q703565) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\) (Q710991) (← links)
- Modular composition via factorization (Q722764) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- The asymptotic induced matching number of hypergraphs: balanced binary strings (Q783062) (← links)
- Threshold arrangements and the knapsack problem (Q812753) (← links)
- Stability versus speed in a computable algebraic model (Q817853) (← links)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions (Q820943) (← links)
- Correction to: ``The complexity of factors of multivariate polynomials'' (Q827013) (← links)
- Tensor decomposition in electronic structure calculations on 3D Cartesian grids (Q834125) (← links)
- Dynamic matrix rank (Q843102) (← links)
- Symmetry transformations for square sliced three-way arrays, with applications to their typical rank (Q852643) (← links)
- Noncommutative convexity arises from linear matrix inequalities (Q860776) (← links)
- Fast matrix multiplication is stable (Q879926) (← links)
- Integer complexity and well-ordering (Q887902) (← links)
- Universality theorems for inscribed polytopes and Delaunay triangulations (Q894687) (← links)
- Complexity of tropical Schur polynomials (Q898243) (← links)
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- Fast multiplication of matrices over a finitely generated semiring (Q963453) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- On the ranks and border ranks of symmetric tensors (Q972614) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Generic and typical ranks of multi-way arrays (Q1020932) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- Semisimple algebras of almost minimal rank over the reals (Q1034526) (← links)
- Fast conversion algorithms for orthogonal polynomials (Q1044602) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- On the complexity of the multiplication of matrices of small formats (Q1394936) (← links)
- The complexity of bivariate power series arithmetic. (Q1401232) (← links)
- A characterization of degenerate tridimensional tensors. (Q1420625) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- On the rigidity of Vandermonde matrices (Q1566747) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
- Lower bounds for some decision problems over \(C\) (Q1605321) (← links)
- Variations on computing reciprocals of power series (Q1607045) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- Balancing bounded treewidth circuits (Q1678757) (← links)
- Ulrich complexity (Q1679674) (← links)
