The following pages link to (Q4385517):
Displayed 24 items.
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- Tensor rank: matching polynomials and Schur rings (Q404298) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- A theory of even functionals and their algorithmic applications (Q672856) (← links)
- Evaluating geometric queries using few arithmetic operations (Q694567) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Semisimple algebras of almost minimal rank over the reals (Q1034526) (← links)
- Test complexity of generic polynomials (Q1201154) (← links)
- Using fast matrix multiplication to find basic solutions (Q1275090) (← links)
- Easy lower bound for a strange computational model (Q1377572) (← links)
- Lower bounds for arithmetic networks (Q1803554) (← links)
- Efficient evaluation of specific queries in constraint databases (Q1944172) (← links)
- On arithmetic branching programs (Q1961372) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Randomized heuristics for exploiting Jacobian scarcity (Q2885477) (← 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)
- Exact Image Reconstruction from a Single Projection through Real Computation (Q3439189) (← links)
- Decidability and modules over Bézout domains (Q5239174) (← links)
- Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm (Q5270844) (← links)
- Tensors in computations (Q5887832) (← links)
- A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)
- Numerical stability and tensor nuclear norm (Q6153359) (← links)