Diophantine linear system solving

No abstract is available for this paper.

• Publication year

  1999

• Venue

  International Symposium on Symbolic and Algebraic Computation

• Publication date

  1999-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/309831.309905
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast deterministic computation of determinants of dense matrices

  1999cited by this paper
• Certifying inconsistency of sparse linear systems

  1998cited by this paper
• Processor-efficient parallel matrix inversion over abstract fields: two extensions

  1997cited by this paper
• Efficient parallel solution of sparse systems of linear diophantine equations

  1997cited by this paper
• Algorithmic number theory

  1996cited by this paper
• Efficient Rational Number Reconstruction

  1995cited by this paper
• Algorithms for computer algebra

  1992cited by this paper
• Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases

  1992cited by this paper
• Solving sparse linear equations over finite fields

  1986cited by this paper
• Finite fields

  1983cited by this paper
• Exact solution of linear equations usingP-adic expansions

  1982cited by this paper
• Approximate formulas for some functions of prime numbers

  1962cited by this paper

• Computing the Hermite Normal Form: A Survey

  2024cites this paper
• Effective Matrix Methods in Commutative Domains

  2017influential citation
• 3-ranks for strongly regular graphs

  2015cites this paper
• Inference Attacks and Control on Database Structures

  2015cites this paper
• A BLAS based implementation of nonsingular rational system solving by Lawrence

  2015influential citation
• Duality methods in networks, computer science models, and disordered condensed matter systems

  2014cites this paper
• Computing the invariant structure of integer matrices: fast algorithms into practice

  2013cites this paper
• Hermite normal forms and its cryptographic applications

  2013cites this paper
• Deterministic Unimodularity Certification and Applications for Integer Matrices

  2013cites this paper
• Deterministic Unimodularity Certication and Applications for

  2013cites this paper
• Applications of strong Grobner bases over Euclidean domains

  2013cites this paper
• Solving Very Sparse Rational Systems of Equations

  2011cites this paper
• Exact solutions to linear systems of equations using output sensitive lifting

  2011cites this paper
• Revisiting strong Gröbner bases over Euclidean domains

  2010cites this paper
• Topics in exact precision mathematical programming

  2010influential citation
• Towards an exact adaptive algorithm for the determinant of a rational matrix

  2007influential citation
• Solving sparse rational linear systems

  2006cites this paper
• Solving Sparse Integer Linear Systems

  2006cites this paper
• Algorithms for sparse and black box matrices over finite fields ( Invited talk )

  2006cites this paper
• An introspective algorithm for the integer determinant

  2005cites this paper
• A BLAS based C library for exact linear algebra on integer matrices

  2005influential citation
• Rigorously analyzed algorithms for the discrete logarithm problem in quadratic number fields

  2004cites this paper
• Certified dense linear system solving

  2004influential citation
• Cited References

  2003cites this paper
• Number field cryptography

  2003cites this paper
• Solution of Systems of Linear Equations by the p-Adic Method

  2003influential citation
• High-order lifting and integrality certification

  2003cites this paper
• On computation of the greatest common divisor of several polynomials over a finite field

  2003cites this paper
• A note on the hermite basis computation of large integer matrices

  2003cites this paper
• On lattice reduction for polynomial matrices

  2003cites this paper
• An Accelerated Buchmann Algorithm for Regulator Computation in Real Quadratic Fields

  2002cites this paper
• High-order lifting

  2002cites this paper
• Efficient matrix preconditioners for black box linear algebra

  2002cites this paper
• Algorithms for Large Integer Matrix Problems

  2001cites this paper
• A linear space algorithm for computing the hermite normal form

  2001influential citation
• On Efficient Sparse Integer Matrix Smith Normal Form Computations

  2001cites this paper
• Fast Modular Algorithms for Squarefree Factorization and Hermite Integration

  2001cites this paper
• Solution of Systems of Linear Diophantine Equations

  2001cites this paper
• On computing the determinant and Smith form of an integer matrix

  2000cites this paper
• Challenges of Symbolic Computation: My Favorite Open Problems

  2000cites this paper
• Rational solutions of singular linear systems

  2000cites this paper
• Challenges of Symbolic Computation : My Favorite Open Problems †

  2000cites this paper
• Asymptotically Fast Discrete Logarithms in Quadratic Number Fields

  2000cites this paper
• Algorithms for matrix canonical forms

  2000cites this paper
• Integer Smith form via the valence: experience with large sparse matrices from homology

  2000cites this paper
• Fast Modular Algorithms for Squarefree Factorization and Hermite Integration

  1999cites this paper
• Fast deterministic computation of determinants of dense matrices

  1999cites this paper
• Challenges of Symbolic Computation My Favorite Open Problems

  1998cites this paper