Design and implementation of multi-threaded algorithms in polynomial algebra
From MaRDI portal
Publication:6666514
DOI10.1145/3452143.3465511WikidataQ131123234 ScholiaQ131123234MaRDI QIDQ6666514
Publication date: 20 January 2025
symbolic computationparallel algorithmsparallel processingthread-level parallelismcache complexityparallel patterns
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for computing triangular decomposition of polynomial systems
- Sparse polynomial division using a heap
- Quantifier elimination in automatic loop parallelization
- Modern computer algebra
- Parallel sparse polynomial multiplication using heaps
- Julia: A Fresh Approach to Numerical Computing
- BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
- Cache-Oblivious Algorithms
- Big Prime Field FFT on Multi-core Processors
- Highly Scalable Multiplication for Distributed Sparse Multivariate Polynomials on Many-Core Systems
- A zero structure theorem for polynomial-equations-solving and its applications
- Analysing cache effects in distribution sorting
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
This page was built for publication: Design and implementation of multi-threaded algorithms in polynomial algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666514)
