Pages that link to "Item:Q1930169"
From MaRDI portal
The following pages link to On the bit-complexity of sparse polynomial and series multiplication (Q1930169):
Displaying 19 items.
- A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery (Q376164) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Multi-point evaluation in higher dimensions (Q1938507) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- On the choice of a multiplication algorithm for polynomials and polynomial matrices (Q2452938) (← links)
- Output-sensitive algorithms for sumset and sparse polynomial multiplication (Q2819733) (← links)
- Multi-key Homomorphic Authenticators (Q2953787) (← links)
- On the Complexity of Multivariate Polynomial Division (Q4610026) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- Nearly Optimal Sparse Polynomial Multiplication (Q5138887) (← links)
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
- Fast interpolation of multivariate polynomials with sparse exponents (Q6665433) (← links)
- On exact division and divisibility testing for sparse polynomials (Q6666532) (← links)
