<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Rational Function Simplification for Integration-by-Parts Reduction and Beyond · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2304.13418/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2304.13418/feed.xml" rel="self" type="application/rss+xml" /><item><title>Rational Function Simplification for Integration-by-Parts Reduction and Beyond — mentioned by SPACECADET3D</title><link>https://news.ycombinator.com/item?id=40306717</link><guid isPermaLink="false">urn:hackerpapers:mention:2304.13418:40306717</guid><pubDate>Thu, 09 May 2024 10:10:22 GMT</pubDate><description>&lt;p&gt;Most of these features are included in Symbolica in some capacity (ODE solving is missing) and there are CAS features Symbolica has and that Maxima has not (like advanced pattern matching), even though it is only a year old. It is not just a matter of whether a feature is there, it needs to be usable in practice. You cannot use Maxima to do computation with large rational polynomials as this paper shows: https://arxiv.org/pdf/2304.13418 Symbolica is 10 times faster and uses 60 times less memory than Maxima on a medium-sized problem. The larger sized problem does not run with Maxima. Note that…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2304.13418/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>hep-ph</category></item></channel></rss>
