On the hierarchical community structure of practical Boolean formulas
DOI10.1007/978-3-030-80223-3_25OpenAlexW3184756489MaRDI QIDQ2118321FDOQ2118321
Authors: Chun-Xiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh 
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2103.14992
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)
Cites Work
- Computer Aided Verification
- Fast planning through planning graph analysis
- Scikit-learn: machine learning in Python
- Random forests
- Fast unfolding of communities in large networks
- Theory and Applications of Satisfiability Testing
- Expander graphs and their applications
- Satisfiability, branch-width and Tseitin tautologies
- The complexity of theorem-proving procedures
- SATzilla: portfolio-based algorithm selection for SAT
- Title not available (Why is that?)
- On the Hardness of SAT with Community Structure
- The community structure of SAT formulas
- Generating SAT instances with community structure
- Impact of Community Structure on SAT Solver Performance
- The fractal dimension of SAT formulas
- Short proofs are narrow—resolution made simple
- Title not available (Why is that?)
- Determining computational complexity from characteristic ‘phase transitions’
- Generating hard satisfiability problems
- Learning Rate Based Branching Heuristic for SAT Solvers
- Title not available (Why is that?)
- Random 3-SAT: The plot thickens
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: On the hierarchical community structure of practical Boolean formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118321)
