<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Formal Proof of SCHUR Conjugate Function · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1004.5034/</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/1004.5034/feed.xml" rel="self" type="application/rss+xml" /><item><title>Formal Proof of SCHUR Conjugate Function — mentioned by pascal_cuoq</title><link>https://news.ycombinator.com/item?id=1954181</link><guid isPermaLink="false">urn:hackerpapers:mention:1004.5034:1954181</guid><pubDate>Tue, 30 Nov 2010 14:36:18 GMT</pubDate><description>&lt;p&gt;Where does the &amp;quot;world&amp;#x27;s fastest&amp;quot; claim come from, and how was it determined? Z3 is a good SMT prover for some formulas that come from program verification, but it is neither uniformly better nor faster than other provers, one of which predates it by what, 10 years? See the result tables in http://arxiv.org/abs/1004.5034 . Pay attention to the &amp;quot;Simplify&amp;quot; column.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1004.5034/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
