我们如何领导3- XORSAT挑战：从能源格局到算法及其在GPU上的高效实现
How we are leading a 3-XORSAT challenge: from the energy landscape to the algorithm and its efficient implementation on GPUs
摘要：
最近的3-XORSAT挑战需要最小化一个非常复杂和粗糙的能量函数，典型的玻璃模型具有随机的一阶跃迁和高尔夫球场般的能量景观。我们提出了超越准贪婪算法及其在GPU上非常有效的实现的想法，使我们能够在这样的竞争中排名第一。我们提出了一个更好的协议来比较算法的性能，我们还提供了分析预测的指数增长的时间，以找到解决方案的自由能障碍。
英文摘要：
A recent 3-XORSAT challenge required to minimize a very complex and rough energy function, typical of glassy models with a random first order transition and a golf course like energy landscape. We present the ideas beyond the quasi-greedy algorithm and its very efficient implementation on GPUs that are allowing us to rank first in such a competition. We suggest a better protocol to compare algorithmic performances and we also provide analytical predictions about the exponential growth of the times to find the solution in terms of free-energy barriers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
