A push-button compiler for polyhedral reductions automatically simplified an O(N^4) RNA-folding recurrence into four O(N^3) programs, one matching a classic 1999 result and three that are new.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Simplification of Polyhedral Reductions in Practice
A push-button compiler for polyhedral reductions automatically simplified an O(N^4) RNA-folding recurrence into four O(N^3) programs, one matching a classic 1999 result and three that are new.