The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$

作者: Daniel Berend , Yochai Twitto

DOI: 10.1007/978-3-319-40970-2_5

关键词: Time complexityCombinatoricsMaximum satisfiability problemAutocorrelationLocal search (constraint satisfaction)MathematicsExpected valueRandom assignmentCovarianceCombinatorial optimization

摘要: In this paper we show that the so-called normalized autocorrelation length of random Max \(r\)-Sat converges in probability to \((1-1/2^r)/r\), where r is number literals a clause. We also correlation between numbers clauses satisfied by pair assignments distance \(d=cn\), \(0 \le c 1\), \(((1-c)^r-1/2^r)/(1-1/2^r)\). The former quantity interest area landscape analysis as way better understand problems and assess their hardness for local search heuristics. [34], it has been shown may be calculated polynomial time any instance, its mean value over all instances was discussed. Our results are based on study variance assignment, covariance an arbitrary distance. As part study, closed-form formulas expected latter two quantities provided. Note relevant well.

参考文章(33)
Robert B. Heckendorn, Soraya Rana, Darrell Whitley, Polynomial time summary statistics for a generalization of MAXSAT genetic and evolutionary computation conference. pp. 281- 288 ,(1999)
Nina Narodytska, Fahiem Bacchus, Maximum satisfiability using core-guided MAXSAT resolution national conference on artificial intelligence. pp. 2717- 2723 ,(2014)
Jessica Davies, Fahiem Bacchus, Solving MAXSAT by solving a sequence of simpler SAT instances principles and practice of constraint programming. pp. 225- 239 ,(2011) , 10.1007/978-3-642-23786-7_19
Bernd Freisleben, Peter Merz, Fitness landscapes and memetic algorithm design New ideas in optimization. pp. 245- 260 ,(1999)
Dave A. D. Tompkins, Holger H. Hoos, UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT Theory and Applications of Satisfiability Testing. pp. 306- 320 ,(2005) , 10.1007/11527695_24
Ehud Friedgut, appendix by Jean Bourgain, Sharp thresholds of graph properties, and the -sat problem Journal of the American Mathematical Society. ,vol. 12, pp. 1017- 1054 ,(1999) , 10.1090/S0894-0347-99-00305-7
Holger H. Hoos, Kevin Smyth, Thomas Stützle, Search Space Features Underlying the Performance of Stochastic Local Search Algorithms for MAX-SAT parallel problem solving from nature. ,vol. 3242, pp. 51- 60 ,(2004) , 10.1007/978-3-540-30217-9_6
Hans van Maaren, Marijn Heule, Toby Walsh, Armin Biere, Handbook of satisfiability IOS Press. ,(2009)
Bart Selman, David Mitchell, Hector Levesque, A new method for solving hard satisfiability problems national conference on artificial intelligence. pp. 440- 446 ,(1992)
Eric Angel, Vassilis Zissimopoulos, On the classification of NP-complete problems in terms of their correlation coefficient Discrete Applied Mathematics. ,vol. 99, pp. 261- 277 ,(2000) , 10.1016/S0166-218X(99)00138-9