scientific article; zbMATH DE number 1114008

zbMATH Open0891.68101MaRDI QIDQ4375776FDOQ4375776

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

Publication date: 8 February 1998

Title of this publication is not available (Why is that?)

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

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)

Cited In (14)

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

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)