Ju l 2 01 9 Scale-Free Random SAT Instances
暂无分享,去创建一个
[1] Andrei A. Bulatov,et al. Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model , 2019, SAT.
[2] Tobias Friedrich,et al. The Satisfiability Threshold for Non-Uniform Random 2-SAT , 2019, ICALP.
[3] Ralf Rothenberger,et al. Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT , 2018, SAT.
[4] Thomas Sauerwald,et al. Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT , 2017, ESA.
[5] Andrew M. Sutton,et al. Phase Transitions for Scale-Free SAT Formulas , 2017, AAAI.
[6] Maria Luisa Bonet,et al. Community Structure in Industrial SAT Instances , 2016, J. Artif. Intell. Res..
[7] Carlos Ansótegui,et al. Using Community Structure to Detect Relevant Learnt Clauses , 2015, SAT.
[8] Oliver Kullmann,et al. Unified Characterisations of Resolution Hardness Measures , 2014, SAT.
[9] Tomohiro Sonobe,et al. Community Branching for Parallel Portfolio SAT Solvers , 2014, SAT.
[10] Sebastian Fischmeister,et al. Impact of Community Structure on SAT Solver Performance , 2014, SAT.
[11] Maria Luisa Bonet,et al. The Fractal Dimension of SAT Formulas , 2013, IJCAR.
[12] Vasco M. Manquinho,et al. Community-Based Partitioning for MaxSAT Solving , 2013, SAT.
[13] George Katsirelos,et al. Eigenvector Centrality in Industrial SAT Instances , 2012, CP.
[14] Carlos Ansótegui,et al. The Community Structure of SAT Formulas , 2012, SAT.
[15] Alistair Sinclair,et al. Delaying satisfiability for random 2SAT , 2010, Random Struct. Algorithms.
[16] Maria Luisa Bonet,et al. On the Structure of Industrial SAT Instances , 2009, CP.
[17] Maria Luisa Bonet,et al. Towards Industrial-Like Random SAT Instances , 2009, IJCAI.
[18] Maria Luisa Bonet,et al. Random SAT Instances à la Carte , 2008, CCIA.
[19] Alan M. Frieze,et al. Random 2-SAT with Prescribed Literal Degrees , 2007, Algorithmica.
[20] Maria Luisa Bonet,et al. What Is a Real-World SAT Instance? , 2007, CCIA.
[21] Bart Selman,et al. The state of SAT , 2007, Discret. Appl. Math..
[22] Andrzej Rucinski,et al. Random graphs , 2006, SODA.
[23] Bart Selman,et al. Regular Random k-SAT: Properties of Balanced Formulas , 2005, Journal of Automated Reasoning.
[24] Bart Selman,et al. Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search , 2003, CP.
[25] Sergey N. Dorogovtsev,et al. Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .
[26] Daniel Mueller,et al. Connected , 2020, Connected.
[27] K. Goh,et al. Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.
[28] Cristopher Moore,et al. The phase transition in 1-in-k SAT and NAE 3-SAT , 2001, SODA '01.
[29] Cohen,et al. Resilience of the internet to random breakdowns , 2000, Physical review letters.
[30] Bart Selman,et al. Satisfiability testing: recent developments and challenge problems , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[31] Fan Chung Graham,et al. A random graph model for massive graphs , 2000, STOC '00.
[32] S. N. Dorogovtsev,et al. Evolution of networks with aging of sites , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[33] S. Kirkpatrick,et al. 2+p-SAT: Relation of typical-case complexity to the nature of the phase transition , 1999, Random Struct. Algorithms.
[34] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[35] Wei Li,et al. The SAT phase transition , 1999, ArXiv.
[36] Henry A. Kautz,et al. Ten Challenges in Propositional Reasoning and Search , 1997, IJCAI.
[37] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[38] Bruce A. Reed,et al. Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[39] Shigeru Mase,et al. Approximations to the birthday problem with unequal occurrence probabilities and their application to the surname problem in Japan , 1992, Annals of the Institute of Statistical Mathematics.
[40] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[41] Robert E. Tarjan,et al. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..
[42] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.
[43] A. Andrew,et al. Emergence of Scaling in Random Networks , 1999 .
[44] P. Erdos,et al. On the evolution of random graphs , 1984 .
[45] Maria Luisa Bonet,et al. Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) , 2022 .