Pages that link to "Item:Q4286224"
From MaRDI portal
The following pages link to Computational Complexity of Sparse Rational Interpolation (Q4286224):
Displaying 12 items.
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- Sparse interpolation of multivariate rational functions (Q633622) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Computability of the additive complexity of algebraic circuits with root extracting (Q1351701) (← links)
- Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← 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)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- Reconstructing rational functions with \texttt{FireFly} (Q2698810) (← 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)
