The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability

Satisfiability is considered the canonical NP-complete problem and is used as a starting point for hardness reductions in theory, while in practice heuristic SAT solving algorithms can solve large-scale industrial SAT instances very efficiently. This disparity between theory and practice is believed to be a result of inherent properties of industrial SAT instances that make them tractable. Two characteristic properties seem to be prevalent in the majority of real-world SAT instances, heterogeneous degree distribution and locality. To understand the impact of these two properties on SAT, we study the proof complexity of random k-SAT models that allow to control heterogeneity and locality. Our findings show that heterogeneity alone does not make SAT easy as heterogeneous random k-SAT instances have superpolynomial resolution size. This implies intractability of these instances for modern SAT-solvers. On the other hand, modeling locality with an underlying geometry leads to small unsatisfiable subformulas, which can be found within polynomial time. A key ingredient for the result on geometric random k-SAT can be found in the complexity of higher-order Voronoi diagrams. As an additional technical contribution, we show a linear upper bound on the number of non-empty Voronoi regions, that holds for points with random positions in a very general setting. In particular, it covers arbitrary p-norms, higher dimensions, and weights affecting the area of influence of each point multiplicatively. This is in stark contrast to quadratic lower bounds for the worst case.

[1]  Jesús Giráldez-Cru,et al.  Locality in Random SAT Instances , 2017, IJCAI.

[2]  Cecilia Bohler,et al.  On the Complexity of Higher Order Abstract Voronoi Diagrams , 2013, ICALP.

[3]  Thomas Bläsius,et al.  Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry , 2018, ICALP.

[4]  Nikolaos Fountoulakis,et al.  On the giant component of random hyperbolic graphs , 2013 .

[5]  Marián Boguñá,et al.  Popularity versus similarity in growing networks , 2011, Nature.

[6]  Andrew M. Sutton,et al.  Phase Transitions for Scale-Free SAT Formulas , 2017, AAAI.

[7]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[8]  Thomas Sauerwald,et al.  Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT , 2017, ESA.

[9]  Krzysztof Czarnecki,et al.  Relating Complexity-theoretic Parameters with SAT Solver Performance , 2017, ArXiv.

[10]  Raimund Seidel,et al.  On the number of faces in higher-dimensional Voronoi diagrams , 1987, SCG '87.

[11]  Alan M. Frieze,et al.  Random 2-SAT with Prescribed Literal Degrees , 2007, Algorithmica.

[12]  Lutz Warnke,et al.  On the Method of Typical Bounded Differences , 2012, Combinatorics, Probability and Computing.

[13]  Rex A. Dwyer.  Higher-dimensional voronoi diagrams in linear expected time , 1989, SCG '89.

[14]  D. T. Lee,et al.  An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram , 2011, ESA.

[15]  M. L. Bonet,et al.  Scale-Free Random SAT Instances , 2017 .

[16]  Mariette Yvinec,et al.  Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions , 1995, SCG '95.

[17]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[18]  Maria Luisa Bonet,et al.  On the Structure of Industrial SAT Instances , 2009, CP.

[19]  D. T. Lee,et al.  On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[20]  Andrew M. Sutton,et al.  On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition , 2019, TACAS.

[21]  Jeff Erickson,et al.  Dense Point Sets Have Sparse Delaunay Triangulations or “... But Not Too Nasty” , 2001, SODA '02.

[22]  Hyeon-Suk Na,et al.  On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes , 2003, Comput. Geom..

[23]  B. Boots.  Weighting Thiessen Polygons , 1980 .

[24]  Martin Raab,et al.  "Balls into Bins" - A Simple and Tight Analysis , 1998, RANDOM.

[25]  Sanjit A. Seshia,et al.  On the Hardness of SAT with Community Structure , 2016, SAT.

[26]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[27]  Dmitri V. Krioukov,et al.  Scale-free Networks Well Done , 2018, Physical Review Research.

[28]  Sebastian Fischmeister,et al.  Impact of Community Structure on SAT Solver Performance , 2014, SAT.

[29]  Amin Vahdat,et al.  Hyperbolic Geometry of Complex Networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Andrei A. Bulatov,et al.  Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model , 2019, SAT.

[31]  Jan Vitek,et al.  Redundancy and coverage detection in sensor networks , 2006, TOSN.

[32]  Adnan Darwiche,et al.  On the power of clause-learning SAT solvers as resolution engines , 2011, Artif. Intell..

[33]  Krzysztof Czarnecki,et al.  The Effect of Structural Measures and Merges on SAT Solver Performance , 2018, CP.

[34]  Jeff Erickson,et al.  Nice Point Sets Can Have Nasty Delaunay Triangulations , 2001, SCG '01.

[35]  Jeff Erickson,et al.  Dense point sets have sparse Delaunay triangulations , 2001, ArXiv.

[36]  Antonio Galvão Naclério Novaes,et al.  A multiplicatively-weighted Voronoi diagram approach to logistics districting , 2006, Comput. Oper. Res..

[37]  Benjamin Raichel,et al.  Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams , 2020, ESA.

[38]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[39]  Sariel Har-Peled,et al.  On the Expected Complexity of Voronoi Diagrams on Terrains , 2016, TALG.

[40]  V. Klee.  On the complexity ofd- dimensional Voronoi diagrams , 1979 .

[41]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[42]  Jacobo Torán,et al.  Space Bounds for Resolution , 1999, STACS.

[43]  Carlos Ansótegui,et al.  The Community Structure of SAT Formulas , 2012, SAT.

[44]  Alessandro Panconesi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .

[45]  Maria Luisa Bonet,et al.  Towards Industrial-Like Random SAT Instances , 2009, IJCAI.

[46]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[47]  Ralph Keusch,et al.  Sampling Geometric Inhomogeneous Random Graphs in Linear Time , 2017, ESA.

[48]  Tobias Friedrich,et al.  The Satisfiability Threshold for Non-Uniform Random 2-SAT , 2019, ICALP.

[49]  Peter van Beek,et al.  Backtracking Search Algorithms , 2006, Handbook of Constraint Programming.

[50]  Jesús Giráldez-Cru,et al.  A Modularity-Based Random SAT Instances Generator , 2015, IJCAI.

[51]  Sariel Har-Peled,et al.  On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams , 2015, Discret. Comput. Geom..

[52]  Friedhelm Meyer auf der Heide,et al.  Average case complexity of Voronoi diagrams of n sites from the unit cube , 2005, EuroCG.

[53]  Tobias Müller,et al.  The diameter of KPKVB random graphs , 2019, Advances in Applied Probability.

[54]  Franz Aurenhammer,et al.  An optimal algorithm for constructing the weighted voronoi diagram in the plane , 1984, Pattern Recognit..

[55]  D. T. Lee,et al.  Higher Order City Voronoi Diagrams , 2012, SWAT.

[56]  Ketan Mulmuley,et al.  On levels in arrangements and voronoi diagrams , 1991, Discret. Comput. Geom..

[57]  Space complexity of random formulae in resolution , 2003, Random Struct. Algorithms.

[58]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[59]  Ashish Sabharwal,et al.  Non-Restarting SAT Solvers with Simple Preprocessing Can Efficiently Simulate Resolution , 2014, AAAI.

[60]  Tobias Friedrich,et al.  Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs , 2019, Theory of Computing Systems.