scientific article; zbMATH DE number 1114008

MaRDI QIDQ4375776zbMATH OpenFDO

Authors L. M. Kirousis, Evangelos Kranakis, D. Krizanc

Publication date 8 February 1998

zbMATH Keywords

occupancy problem

Mathematics Subject Classification ID

Classical propositional logic (03B05) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Approximating the unsatisfiability threshold of random formulas
• Approximating the unsatisfiability threshold of random formulas (extended abstract)
• The unsatisfiability threshold revisited
• A new upper bound for 3-SAT

Cited in

(16)

• On the satisfiability threshold of formulas with three literals per clause
• Pairs of SAT-assignments in random Boolean formulæ
• The unsatisfiability threshold revisited
• The unsatisfiability threshold revisited
• An improved upper bound on the non-3-colourability threshold
• A new upper bound for 3-SAT
• Approximating the unsatisfiability threshold of random formulas
• A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
• scientific article; zbMATH DE number 2044510 (Why is no real title available?)
• Approximating the unsatisfiability threshold of random formulas (extended abstract)
• scientific article; zbMATH DE number 2159650 (Why is no real title available?)
• Tail bounds for occupancy and the satisfiability threshold conjecture
• A threshold for unsatisfiability
• A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses
• Results related to threshold phenomena research in satisfiability: Lower bounds
• Upper bounds on the satisfiability threshold

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 Q4375776)