On the hierarchical community structure of practical Boolean formulas
Modern CDCL SAT solvers easily solve industrial instances containing tens of millions of
variables and clauses, despite the theoretical intractability of the SAT problem. This gap …
variables and clauses, despite the theoretical intractability of the SAT problem. This gap …
Scale-free random SAT instances
We focus on the random generation of SAT instances that have properties similar to real-
world instances. It is known that many industrial instances, even with a great number of …
world instances. It is known that many industrial instances, even with a great number of …
The satisfiability threshold for non-uniform random 2-SAT
T Friedrich, R Rothenberger - arXiv preprint arXiv:1904.02027, 2019 - arxiv.org
Propositional satisfiability (SAT) is one of the most fundamental problems in computer
science. Its worst-case hardness lies at the core of computational complexity theory, for …
science. Its worst-case hardness lies at the core of computational complexity theory, for …
[PDF][PDF] On the hierarchical community structure of practical sat formulas
C Li, J Chung, S Mukherjee, M Vinyals… - arXiv preprint arXiv …, 2021 - easychair.org
Mo dernCDCLSA Tsolverseasilysolveindustrial instances containingtensofmillions
ofvariablesandclauses, despitethetheoretical in tractability of the SA T problem. This gap …
ofvariablesandclauses, despitethetheoretical in tractability of the SA T problem. This gap …
Understanding and Improving SAT Solvers via Proof Complexity and Reinforcement Learning
C Li - 2023 - uwspace.uwaterloo.ca
Despite the fact that the Boolean satisfiability (SAT) problem is NP-complete and believed to
be intractable, SAT solvers are routinely used by practitioners to solve hard problems in …
be intractable, SAT solvers are routinely used by practitioners to solve hard problems in …
[PDF][PDF] Theoretical Study of Data Reduction in Real-World Hitting Set Instances
M Wunderlich - 2024 - scale.iti.kit.edu
Finding a minimum HittingSet is a fundamental optimization problem on hypergraphs.
Despite being NP-complete and even𝑊 [2]-complete (if parametrized by solution size), many …
Despite being NP-complete and even𝑊 [2]-complete (if parametrized by solution size), many …
[PDF][PDF] Anzahl inklusionsmaximaler Cliquen in geometrischen Zufallsgraphen
N Lemke - scale.iti.kit.edu
Modelle zu finden und zu untersuchen, welche Graphen erzeugen, die möglichst gut mit
echten Netzwerken übereinstimmen, ist Kern des Forschungsgebiet „Network Science" …
echten Netzwerken übereinstimmen, ist Kern des Forschungsgebiet „Network Science" …