Popularity-similarity random SAT formulas
From MaRDI portal
Recommendations
Cites work
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Bounds on the satisfiability threshold for power law distributed random SAT
- Community structure in industrial SAT instances
- Emergence of Scaling in Random Networks
- Finding efficient circuits for ensemble computation
- Generating SAT instances with community structure
- Geometric inhomogeneous random graphs
- Learning rate based branching heuristic for SAT solvers
- On the community structure of bounded model checking SAT problems
- On the hardness of SAT with community structure
- Random 2-SAT with prescribed literal degrees
- SAT-based MaxSAT algorithms
- Satisfiability threshold for power law random 2-SAT in configuration model
- Sharpness of the satisfiability threshold for non-uniform random \(k\)-SAT
- Solving propositional satisfiability problems
- Ten challenges \textit{redux}: recent progress in propositional reasoning and search
- The community structure of SAT formulas
- The fractal dimension of SAT formulas
- The state of SAT
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Using Community Structure to Detect Relevant Learnt Clauses
Cited in
(7)- A model of random industrial SAT
- New models for generating hard random Boolean formulas and disjunctive logic programs
- The fractal dimension of SAT formulas
- Locality and hard SAT-instances
- scientific article; zbMATH DE number 1954175 (Why is no real title available?)
- Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden
- The length of an unsatisfiable subformula
Describes a project that uses
Uses Software
This page was built for publication: Popularity-similarity random SAT formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238712)
