scientific article; zbMATH DE number 2080304
From MaRDI portal
Publication:4473023
Recommendations
Cited in
(11)- Random 3-SAT: The plot thickens
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT
- A sharp threshold in proof complexity yields lower bounds for satisfiability search
- New models for generating hard random Boolean formulas and disjunctive logic programs
- On the typical case complexity of graph optimization
- Implicates and prime implicates in random 3-SAT
- Critical behavior in the computational cost of satisfiability testing
- scientific article; zbMATH DE number 2084701 (Why is no real title available?)
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473023)