Insights into glass formation and glass transition in supercooled liquids, by study of related phenomena in crystals · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/0712.4233/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTInsights into glass formation and glass transition in supercooled liquids, by study of related phenomena in crystals — mentioned by auferstehunghttps://news.ycombinator.com/item?id=94761urn:hackerpapers:mention:0712.4233:94761Fri, 04 Jan 2008 11:50:50 GMT<p>It is my understanding that the hard part is when m/n ~1 (P/N~1 in wikipedia terms). Does your O(sqrt(2)^N) algorithm work well for 1000 numbers between 1 and 2^1000. Wikipedia says, &quot;We give efficient algorithms for both small N and small P cases below,&quot; which would seem to imply the answer is no. Regardless, the most interesting aspect of the article to me was the existence of a phase transition between easy and hard parts of this type of problem. I found the reference to Stephan Mertens work relating this computational problem to statistical physics, specifically spin glasses, the most…</p><p><a href="https://hackerpaper.kaipfister.de/p/0712.4233/">Paper and discussion history</a>. A mention is not an endorsement.</p>cond-mat.dis-nn