The following pages link to Thomas Lickteig (Q171408):
Displaying 21 items.
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- A note on border rank (Q794161) (← links)
- Typical tensorial rank (Q1064383) (← links)
- Gaussian elimination is optimal for solving linear equations in dimension two (Q1076478) (← links)
- On the order of approximation in approximative triadic decompositions of tensors (Q1123957) (← links)
- Cauchy index computation (Q1127957) (← links)
- Test complexity of generic polynomials (Q1201154) (← links)
- Verification complexity of linear prime ideals (Q1207526) (← links)
- On randomized semi-algebraic test complexity (Q1260656) (← links)
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks (Q1361878) (← links)
- A note on testing the resultant (Q1908893) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- How can a complex square root be computed in an optimal way? (Q1918948) (← links)
- Semi-algebraic complexity of quotients and sign determination of remainders (Q2365423) (← links)
- A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras (Q3835017) (← links)
- The Computational Complexity of Division in Quadratic Extension Fields (Q4205081) (← links)
- (Q4234080) (← links)
- (Q4361549) (← links)
- (Q4717936) (← links)
- (Q4745258) (← links)
- Sylvester-Habicht sequences and fast Cauchy index computation (Q5929709) (← links)
