Random Horn formulas and propagation connectivity for directed hypergraphs

MaRDI QIDQ5403025zbMATH OpenFDO

Authors Despina Stasi, Gy. Turán, R. H. Sloan

Publication date 25 March 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2295/0.html

zbMATH Keywords

propagation connectivityrandom Horn formulas

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Hypergraphs (05C65)

Recommendations

• Propagation connectivity of random hypergraphs
• Propagation connectivity of random hypergraphs
• scientific article; zbMATH DE number 2151254
• Combinatorial Problems for Horn Clauses
• The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas

Cited in

(5)

• Propagation Connectivity of Random Hypergraphs
• On the hydra number of disconnected graphs
• Propagation connectivity of random hypergraphs
• Hydras: directed hypergraphs and Horn formulas
• Propagation connectivity of random hypergraphs

This page was built for publication: Random Horn formulas and propagation connectivity for directed hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403025)