<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Efficient implementation of elementary functions in the medium-precision range · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1410.7176/</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/1410.7176/feed.xml" rel="self" type="application/rss+xml" /><item><title>Efficient implementation of elementary functions in the medium-precision range — mentioned by fdej</title><link>https://news.ycombinator.com/item?id=8829359</link><guid isPermaLink="false">urn:hackerpapers:mention:1410.7176:8829359</guid><pubDate>Sat, 03 Jan 2015 00:30:04 GMT</pubDate><description>&lt;p&gt;Related: I recently published a preprint describing some techniques to speed up evaluation of transcendental functions in the range of a few hundred bits to a few thousand bits: http://arxiv.org/abs/1410.7176&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1410.7176/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.MS</category></item></channel></rss>
