Two parallel dynamic lexicographic algorithms for factorization sets in numerical semigroups

July 30, 2024 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"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 shame:
Not yet rated
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

The dual of an evaluation code

Hiram H. LΓ³pez, Ivan Soprunov, Rafael H. Villarreal

math.AC πŸ› DCC πŸ“š 20 cites 5 years ago

Died the same way β€” πŸ‘» Ghosted