Polynomial evaluation over finite fields: new algorithms and complexity bounds · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1102.4772/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTPolynomial evaluation over finite fields: new algorithms and complexity bounds — mentioned by stevefan1999https://news.ycombinator.com/item?id=45830694urn:hackerpapers:mention:1102.4772:45830694Thu, 06 Nov 2025 02:25:04 GMT<p>As someone who used std::simd in an attempt for submitting to an academic conference CFP*, I have look deep into how std::simd and I would conclude that there are a couple of reasons it isn&#x27;t stable yet (this is rather long and maybe need 10 minutes to read): 1. It is highly depending on LLVM intrinsics which itself can change quite a lot. Sometimes the intrinsic would even fail to instantiate and crashed the entire compilation. I for example met chronic ICE crashes for the same code in different nightly Rust version. Then I realize it is because the SIMD operation was too complicated and I…</p><p><a href="https://hackerpaper.kaipfister.de/p/1102.4772/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.IT