Two parallel dynamic lexicographic algorithms for factorization sets in numerical semigroups
July 30, 2024 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Thomas Barron
arXiv ID
2407.20474
Category
math.AC
Cross-listed
cs.DC,
math.CO
Citations
0
Venue
arXiv.org
Last Checked
1 month ago
Abstract
To the existing dynamic algorithm FactorizationsUpToElement for factorization sets of elements in a numerical semigroup, we add lexicographic and parallel behavior. To the existing parallel lexicographic algorithm for the same, we add dynamic behavior. The (dimensionwise) dynamic algorithm is parallelized either elementwise or factorizationwise, while the parallel lexicographic algorithm is made dynamic with low-dimension tabulation. The tabulation for the parallel lexicographic algorithm can itself be performed using the dynamic algorithm. We provide reference CUDA implementations with measured runtimes.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.AC
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
The dual of an evaluation code
R.I.P.
π»
Ghosted
Generalized minimum distance functions
R.I.P.
π»
Ghosted
Generalized star configurations and the Tutte polynomial
R.I.P.
π»
Ghosted
Minimum distance functions of complete intersections
R.I.P.
π»
Ghosted
Higher Hamming weights for locally recoverable codes on algebraic curves
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted