Random Horn formulas and propagation connectivity for directed hypergraphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2012

Random Horn formulas and propagation connectivity for directed hypergraphs

Résumé

We consider the property that in a random definite Horn formula of size-3 clauses over n variables, where every such clause is included with probability p, there is a pair of variables for which forward chaining produces all other variables. We show that with high probability the property does not hold for p <= 1/(11n ln n), and does hold for p >= (5 1n ln n)/(n ln n).
Fichier principal
Vignette du fichier
2295-7354-1-PB.pdf (246.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00990587 , version 1 (13-05-2014)

Identifiants

Citer

Robert H. Sloan, Despina Stasi, György Turán. Random Horn formulas and propagation connectivity for directed hypergraphs. Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 2 (2), pp.29--35. ⟨10.46298/dmtcs.578⟩. ⟨hal-00990587⟩

Collections

TDS-MACS
72 Consultations
889 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More