The fractal dimension of SAT formulas
DOI10.1007/978-3-319-08587-6_8zbMATH Open1423.68429arXiv1308.5046OpenAlexW3104641269WikidataQ60512053 ScholiaQ60512053MaRDI QIDQ3192184FDOQ3192184
Authors: Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy
Publication date: 26 September 2014
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.5046
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Fractals (28A80)
Cited In (12)
- Backdoor DNFs
- Bounds on the satisfiability threshold for power law distributed random SAT
- On the hierarchical community structure of practical Boolean formulas
- Solving non-uniform planted and filtered random SAT formulas greedily
- New width parameters for SAT and \#SAT
- Popularity-similarity random SAT formulas
- Generating SAT instances with community structure
- Fractal structure on \(k\)-SAT
- Evaluating CDCL variable scoring schemes
- Fractal Parallelism: Solving SAT in Bounded Space and Time
- Community structure inspired algorithms for SAT and \#SAT
- Title not available (Why is that?)
This page was built for publication: The fractal dimension of SAT formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192184)