High-order lifting and integrality certification

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Journal of symbolic computation

• Publication date

  2003-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0747-7171(03)00097-X
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On lattice reduction for polynomial matrices

  2003cited by this paper
• Modern computer algebra

  2002cited by this paper
• Rational solutions of singular linear systems

  2000cited by this paper
• On computing the determinant and Smith form of an integer matrix

  2000cited by this paper
• Algorithms for matrix canonical forms

  2000cited by this paper
• Diophantine linear system solving

  1999cited by this paper
• Computing Popov and Hermite forms of polynomial matrices

  1996cited by this paper
• Preconditioning of rectangular polynomial matrices for efficient Hermite normal form computation

  1995cited by this paper
• Fast construction of irreducible polynomials over finite fields

  1994cited by this paper
• Asymptotically fast triangulation of matrices over rings

  1991cited by this paper
• Parallel algorithms for matrix normal forms

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

  1982cited by this paper
• Linear Systems

  1980cited by this paper
• Approximate algorithms to derive exact solutions to systems of linear equations

  1979cited by this paper
• Vermeidung von Divisionen.

  1973cited by this paper
• Multiplication of Multidigit Numbers on Automata

  1963cited by this paper

• Fast computation of Riemann-Roch spaces for singular curves

  2026cites this paper
• Exact Matching in Matrix Multiplication Time

  2025cites this paper
• Computing Krylov iterates in the time of matrix multiplication

  2024cites this paper
• Faster algorithms on linear delta-matroids

  2024cites this paper
• High-order lifting for polynomial Sylvester matrices

  2023influential citation
• Algorithms for simultaneous Hermite-Padé approximations

  2021influential citation
• Constructing a Distance Sensitivity Oracle in O(n2.5794M) Time

  2021cites this paper
• Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices

  2021cites this paper
• An algorithm to recognize regular singular Mahler systems

  2021cites this paper
• On the Probability of Generating a Primitive Matrix

  2021cites this paper
• Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors

  2021cites this paper
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication

  2020influential citation
• Efficient algorithms and implementation in exact linear algebra. (Algorithmes et implantations efficaces en algèbre linéaire exacte)

  2019cites this paper
• Sensitive Distance and Reachability Oracles for Large Batch Updates

  2019cites this paper
• On Fast Matrix Inversion via Fast Matrix Multiplication

  2019cites this paper
• Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants

  2019cites this paper
• Power decoding Reed-Solomon codes up to the Johnson radius

  2018cites this paper
• On Computing the Resultant of Generic Bivariate Polynomials

  2018influential citation
• Interactive Certificates for Polynomial Matrices with Sub-Linear Communication

  2018influential citation
• Fast computation of approximant bases in canonical form

  2018influential citation
• Verification protocols with sub-linear communication for polynomial matrix operations

  2018cites this paper
• Computing Canonical Bases of Modules of Univariate Relations

  2017cites this paper
• Block-Krylov techniques in the context of sparse-FGLM algorithms

  2017influential citation
• Computer Algebra for Lattice path Combinatorics

  2017cites this paper
• Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations

  2016cites this paper
• Exact and approximation algorithms for weighted matroid intersection

  2016cites this paper
• Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field

  2016cites this paper
• A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix

  2016cites this paper
• Fast computation of the Nth term of an algebraic series in positive characteristic

  2016cites this paper
• Algorithms for Simultaneous Padé Approximations

  2016cites this paper
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix

  2016influential citation
• Bases of relations in one or several variables: fast algorithms and applications. (Bases de relations en une ou plusieurs variables : algorithmes rapides et applications)

  2016cites this paper
• Resolving sequences of operators for linear ordinary differential and difference systems of arbitrary order

  2016cites this paper
• Resolving sequences of operators for linear ordinary differential and difference systems of arbitrary order

  2016cites this paper
• A deterministic algorithm for inverting a polynomial matrix

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

  2015influential citation
• Hypergeometric Solutions of First-Order Linear Difference Systems with Rational-Function Coefficients

  2015cites this paper
• Exact Linear Algebra Algorithmic: Theory and Practice

  2015cites this paper
• Algorithmic Applications of Baur-Strassen’s Theorem

  2015cites this paper
• Algebraic Algorithms for Linear Matroid Parity Problems

  2014influential citation
• Fast and deterministic computation of the determinant of a polynomial matrix

  2014cites this paper
• High Performance and Reliable Algebraic Computing. (Calcul Algébrique Fiable et Haute Performance)

  2014cites this paper
• Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors

  2013influential citation
• Complexity estimates for two uncoupling algorithms

  2013cites this paper
• Fast Order Basis and Kernel Basis Computation and Related Problems

  2013cites this paper
• Relaxed p-adic Hensel lifting for algebraic systems

  2012cites this paper
• Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]

  2012influential citation
• Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

  2012influential citation
• Fast computation of Smith forms of sparse matrices over local rings

  2012cites this paper
• Algebraic algorithms for linear matroid parity problems

  2011influential citation
• Computing the Hermite Form of a Matrix of Ore Polynomials

  2011cites this paper
• Algebraic Algorithms in Combinatorial Optimization

  2011cites this paper
• Hermite Forms of Polynomial Matrices

  2011influential citation
• Computing hermite forms of polynomial matrices

  2011cites this paper
• Fast computation of common left multiples of linear ordinary differential operators

  2011cites this paper
• Deterministic solution of a rational linear system of polynomials over

  2010cites this paper
• Algorithmes rapides pour les polynômes, séries formelles et matrices

  2010cites this paper
• Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source

  2010cites this paper
• Algebraic and numerical algorithms

  2010cites this paper
• Maximum weight bipartite matching in matrix multiplication time

  2009cites this paper
• Hermite form computation of matrices of differential polynomials

  2009cites this paper
• ALGEBRAIC AND NUMERICAL ALGORITHMS 1

  2008cites this paper
• Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation

  2008cites this paper
• Fraction-free matrix factors: new forms for LU and QR factors

  2008cites this paper
• Additive preconditioning and aggregation in matrix computations

  2008cites this paper
• Algebraic Graph Algorithms

  2008cites this paper
• Some recent progress in exact linear algebra and related questions

  2007cites this paper
• An algebraic algorithm for weighted linear matroid intersection

  2007influential citation
• Weighted Bipartite Matching in Matrix Multiplication Time

  2006cites this paper
• Mathematisches Forschungsinstitut Oberwolfach Report No . 7 / 2006 Algorithmic Graph Theory

  2006cites this paper
• Weighted Bipartite Matching in Matrix Multiplication Time (Extended Abstract)

  2006cites this paper
• On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix

  2006cites this paper
• TR-2007002: Additive Preconditioning and Aggregation in Matrix Computations

  2006cites this paper
• Essentially optimal computation of the inverse of generic polynomial matrices

  2005cites this paper
• The shifted number system for fast linear algebra on integer matrices

  2005influential citation
• Improved algorithms for computing determinants and resultants

  2005influential citation
• Shortest Paths in Matrix Multiplication Time

  2005cites this paper
• Asymptotically fast polynomial matrix algorithms for multivariable systems

  2005cites this paper
• Computing the rank and a small nullspace basis of a polynomial matrix

  2005influential citation
• Processor Efficient Parallel Matching

  2005influential citation
• TR-2005008: Toeplitz and Hankel Meet Hensel and Newton Modulo a Power of Two

  2005influential citation
• Certified dense linear system solving

  2004cites this paper
• TR-2004013: Toeplitz and Hankel Meet Hensel and Newton: Nearly Optimal Algorithms and Their Practical Acceleration with Saturated Initialization

  2004influential citation
• Algorithmique modulaire des équations différentielles linéaires

  2004cites this paper
• On the complexity of polynomial matrix computations

  2003influential citation
• Exact computations on polynomial and integer matrices

  2003cites this paper
• On the complexity of computing determinants

  2001cites this paper
• Computing Krylov iterates in the time of matrix multiplication

  year unknowninfluential citation
• Computing Krylov iterates in the time of matrix multiplication

  year unknowninfluential citation
• Computing Krylov iterates in the time of matrix multiplication

  year unknowninfluential citation
• Computing Krylov iterates in the time of matrix multiplication

  year unknowninfluential citation
• Computing Krylov iterates in the time of matrix multiplication

  year unknowninfluential citation
• Computing Krylov iterates in the time of matrix multiplication

  year unknowninfluential citation
• Computing Krylov iterates in the time of matrix multiplication

  year unknowninfluential citation
• Computing Krylov iterates in the time of matrix multiplication

  year unknowninfluential citation
• Computing Krylov iterates in the time of matrix multiplication

  year unknowninfluential citation