Pages that link to "Item:Q1168041"
From MaRDI portal
The following pages link to Exact solution of linear equations using p-adic expansions (Q1168041):
Displayed 50 items.
- Solving polynomial systems in integers (Q276637) (← links)
- The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake (Q295658) (← links)
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) (Q412209) (← links)
- Algorithms for polycyclic-by-finite groups (Q507137) (← links)
- On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- Sharply \(k\)-transitive permutation groups viewed as Galois groups (Q662636) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- On the complexity of inverting integer and polynomial matrices (Q901933) (← links)
- Degeneration of structured integer matrices modulo an integer (Q947675) (← links)
- Fast computation of Hermite normal forms of random integer matrices (Q984852) (← links)
- Algorithms for solving linear systems over cyclotomic fields (Q987701) (← links)
- A \(p\)-adic algorithm for computing the inverse of integer matrices (Q1004026) (← links)
- A parallel algorithm for exact solution of linear equations via congruence technique (Q1205881) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- The virtual Haken conjecture: Experiments and examples (Q1426823) (← links)
- On the computation of elementary divisors of integer matrices (Q1599534) (← links)
- On the computation of the HNF of a module over the ring of integers of a number field (Q1711990) (← links)
- Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
- High-order lifting and integrality certification (Q1878491) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- Simultaneous rational function reconstruction with errors: handling multiplicities and poles (Q2100064) (← links)
- Exterior powers of the adjoint representation and the Weyl ring of \(E_8\) (Q2300484) (← links)
- Schur aggregation for linear systems and determinants (Q2378504) (← links)
- The shifted number system for fast linear algebra on integer matrices (Q2387425) (← links)
- An algorithm to solve integer linear systems exactly using numerical methods (Q2457353) (← links)
- Certified dense linear system solving (Q2643521) (← links)
- Minimizing representations over number fields. (Q2643541) (← links)
- Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations (Q2802247) (← links)
- Solving Simple Stochastic Games (Q3507435) (← links)
- On Computing the Hermite Form of a Matrix of Differential Polynomials (Q3644094) (← links)
- Invariant Bilinear Forms on W-Graph Representations and Linear Algebra Over Integral Domains (Q4556579) (← links)
- Deciding the nilpotency of the Galois group by computing elements in the centre (Q4813623) (← links)
- EXACT SOLUTION OF LINEAR EQUATIONS ON DISTRIBUTED-MEMORY MULTIPROCESSORS (Q4820014) (← links)
- Solving p-adic polynomial systems via iterative eigenvector algorithms (Q5064503) (← links)
- $p$-Adic Integral Geometry (Q5148410) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- (Q5239646) (← links)
- Parallelized Solution of Banded Linear Systems with an Introduction to p-adic Computation (Q5270284) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve (Q5458347) (← links)
- Computing Generator in Cyclotomic Integer Rings (Q5738871) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- Super-linear convergence in the <i>p</i> -adic QR-algorithm (Q6039180) (← links)
- Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} (Q6145950) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
- Hardness of graph-structured algebraic and symbolic problems (Q6179415) (← links)