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

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

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

(14)

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

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)