scientific article; zbMATH DE number 1142301
From MaRDI portal
Publication:4385517
Cited in
(24)- Deformation techniques for sparse systems
- Semisimple algebras of almost minimal rank over the reals
- Test complexity of generic polynomials
- Using fast matrix multiplication to find basic solutions
- Easy lower bound for a strange computational model
- Lower bounds for arithmetic networks
- Efficient evaluation of specific queries in constraint databases
- On arithmetic branching programs
- Time-space tradeoffs in algebraic complexity theory
- Randomized heuristics for exploiting Jacobian scarcity
- Parity OBDDs cannot be handled efficiently enough
- The border rank of the multiplication of 2\times 2 matrices is seven
- Fast computation of a rational point of a variety over a finite field
- Exact Image Reconstruction from a Single Projection through Real Computation
- Tensor rank: matching polynomials and Schur rings
- Decidability and modules over Bézout domains
- Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
- Tensors in computations
- A new method to obtain lower bounds for polynomial evaluation
- Polynomial equation solving by lifting procedures for ramified fibers
- Deformation techniques to solve generalised Pham systems
- Numerical stability and tensor nuclear norm
- A theory of even functionals and their algorithmic applications
- Evaluating geometric queries using few arithmetic operations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385517)
