An algorithm reconstructs symbolic IBP reduction coefficients via intermediate bases, demonstrated on massive box-triangle and pentagon-triangle integrals using 3289 and 13013 samplings versus over a million unknowns.
Computational complexity of sparse rational inter- polation,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
hep-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Taming Symbolic IBP Reduction with Intermediate Bases
An algorithm reconstructs symbolic IBP reduction coefficients via intermediate bases, demonstrated on massive box-triangle and pentagon-triangle integrals using 3289 and 13013 samplings versus over a million unknowns.