Pages that link to "Item:Q923629"

The following pages link to Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629):

Displaying 35 items.

• Black-box polynomial resultants (Q286994) (← links)
• Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
• Sparse interpolation of multivariate rational functions (Q633622) (← links)
• A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
• Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
• Univariate polynomial factorization over finite fields (Q1127311) (← links)
• Efficient matrix preconditioners for black box linear algebra (Q1348088) (← links)
• A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
• Equality in computer algebra and beyond. (Q1404423) (← links)
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
• Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
• Improved algorithms for computing determinants and resultants (Q1763424) (← links)
• On the complexity of noncommutative polynomial factorization (Q1784944) (← links)
• Early termination in sparse interpolation algorithms (Q1878478) (← links)
• Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (Q1878479) (← links)
• Sparse shifts for univariate polynomials (Q1924546) (← links)
• A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
• Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
• Sparse polynomial interpolation based on diversification (Q2143469) (← links)
• Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
• Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
• Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
• Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation (Q2482628) (← links)
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
• Reconstructing rational functions with \texttt{FireFly} (Q2698810) (← links)
• Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
• Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
• Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
• (Q5002654) (← links)
• (Q5089246) (← links)
• Symbolic-numeric sparse interpolation of multivariate polynomials (Q5902083) (← links)
• Foreword (Q5918134) (← links)
• Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly} (Q6161965) (← links)
• Balancing act: multivariate rational reconstruction for IBP (Q6173579) (← links)