On the hierarchical community structure of practical Boolean formulas
From MaRDI portal
Publication:2118321
Cites work
- scientific article; zbMATH DE number 3155211 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 7088727 (Why is no real title available?)
- Computer Aided Verification
- Determining computational complexity from characteristic ``phase transitions
- Expander graphs and their applications
- Fast planning through planning graph analysis
- Fast unfolding of communities in large networks
- Generating SAT instances with community structure
- Generating hard satisfiability problems
- Handbook of satisfiability. In 2 parts
- Impact of Community Structure on SAT Solver Performance
- Learning rate based branching heuristic for SAT solvers
- On the hardness of SAT with community structure
- Random 3-SAT: The plot thickens
- Random forests
- SATzilla: portfolio-based algorithm selection for SAT
- Satisfiability, branch-width and Tseitin tautologies
- Scikit-learn: machine learning in Python
- Short proofs are narrow—resolution made simple
- The community structure of SAT formulas
- The complexity of theorem-proving procedures
- The fractal dimension of SAT formulas
- Theory and Applications of Satisfiability Testing
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)