47 citations · 86 across the 11 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017★ 6 cited
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger +2
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory.…
cs.DM2013★ 47 cited
Fitness Probability Distribution of Bit-Flip Mutation
Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley +1
Bit-flip mutation is a common mutation operator for evolutionary algorithms applied to optimize functions over binary strings. In this paper, we develop results from the theory of…