• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

指数级困难问题有时是多项式问题,随机可满足性问题搜索算法的大偏差分析及其在停止并重启求解中的应用。

Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions.

作者信息

Cocco Simona, Monasson Rémi

机构信息

CNRS-Laboratoire de Dynamique des Fluides Complexes, 3 rue de l'Université, 67000 Strasbourg, France.

出版信息

Phys Rev E Stat Nonlin Soft Matter Phys. 2002 Sep;66(3 Pt 2B):037101. doi: 10.1103/PhysRevE.66.037101. Epub 2002 Sep 19.

DOI:10.1103/PhysRevE.66.037101
PMID:12366297
Abstract

A large deviation analysis of the solving complexity of random 3-satisfiability instances slightly below threshold is presented. While finding a solution for such instances demands an exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. This exponentially small probability of easy resolutions is analytically calculated, and the corresponding exponent is shown to be smaller (in absolute value) than the growth exponent of the typical resolution time. Our study therefore gives some theoretical basis to heuristic stop-and-restart solving procedures, and suggests a natural cutoff (the size of the instance) for the restart.

摘要

本文给出了对略低于阈值的随机3 - 可满足性实例求解复杂度的大偏差分析。虽然以高概率找到此类实例的解需要指数级的努力,但我们表明,指数级小比例的归结仅需要与实例大小成线性比例的计算量。我们通过分析计算出了这种容易求解的指数级小概率,并且表明相应的指数(绝对值)小于典型求解时间的增长指数。因此,我们的研究为启发式的停止并重新开始求解过程提供了一些理论基础,并为重新开始提出了一个自然的截止点(实例的大小)。

相似文献

1
Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions.指数级困难问题有时是多项式问题,随机可满足性问题搜索算法的大偏差分析及其在停止并重启求解中的应用。
Phys Rev E Stat Nonlin Soft Matter Phys. 2002 Sep;66(3 Pt 2B):037101. doi: 10.1103/PhysRevE.66.037101. Epub 2002 Sep 19.
2
Trajectories in phase diagrams, growth processes, and computational complexity: how search algorithms solve the 3-satisfiability problem.相图中的轨迹、生长过程与计算复杂性:搜索算法如何解决3可满足性问题。
Phys Rev Lett. 2001 Feb 19;86(8):1654-7. doi: 10.1103/PhysRevLett.86.1654.
3
Behavior of heuristics on large and hard satisfiability problems.启发式算法在大型且困难的可满足性问题上的表现。
Phys Rev E Stat Nonlin Soft Matter Phys. 2006 Sep;74(3 Pt 2):037702. doi: 10.1103/PhysRevE.74.037702. Epub 2006 Sep 18.
4
Relaxation and metastability in a local search procedure for the random satisfiability problem.随机可满足性问题局部搜索过程中的松弛与亚稳定性。
Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Jun;67(6 Pt 2):066103. doi: 10.1103/PhysRevE.67.066103. Epub 2003 Jun 12.
5
A comparative runtime analysis of heuristic algorithms for satisfiability problems.可满足性问题启发式算法的比较运行时分析。
Artif Intell. 2009 Feb;173(2):240-257. doi: 10.1016/j.artint.2008.11.002.
6
Biased random satisfiability problems: from easy to hard instances.有偏随机可满足性问题:从简单实例到困难实例
Phys Rev E Stat Nonlin Soft Matter Phys. 2005 Jun;71(6 Pt 2):066101. doi: 10.1103/PhysRevE.71.066101. Epub 2005 Jun 1.
7
Solving satisfiability problems by fluctuations: the dynamics of stochastic local search algorithms.通过波动解决可满足性问题:随机局部搜索算法的动力学
Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Jun;67(6 Pt 2):066104. doi: 10.1103/PhysRevE.67.066104. Epub 2003 Jun 12.
8
Simplest random K-satisfiability problem.最简单的随机K可满足性问题。
Phys Rev E Stat Nonlin Soft Matter Phys. 2001 Feb;63(2 Pt 2):026702. doi: 10.1103/PhysRevE.63.026702. Epub 2001 Jan 23.
9
Efficient solution of Boolean satisfiability problems with digital memcomputing.利用数字内存计算高效解决布尔可满足性问题。
Sci Rep. 2020 Nov 12;10(1):19741. doi: 10.1038/s41598-020-76666-2.
10
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions.用于寻找布尔可满足性问题的困难变体的划分的算法及其在某些密码函数求逆中的应用。
Springerplus. 2016 Apr 30;5:554. doi: 10.1186/s40064-016-2187-4. eCollection 2016.