论文信息 - Hydra formulas and directed hypergraphs - 字舞流文

Hydra formulas and directed hypergraphs

György Turán | Robert H. Sloan | Despina Stasi | R. Sloan | György Turán | Despina Stasi

[1] Endre Boros,et al. Hardness results for approximate pure Horn CNF formulae minimization , 2012, Annals of Mathematics and Artificial Intelligence.

[2] José L. Balcázar,et al. Construction and learnability of canonical Horn formulas , 2011, Machine Learning.

[3] Dhruv Mubayi,et al. On Approximate Horn Formula Minimization , 2010, ICALP.

[4] Dhruv Mubayi,et al. Combinatorial problems for Horn clauses , 2008, ISAIM.

[5] Michael Frazier,et al. Learning conjunctions of Horn clauses , 2004, Machine Learning.

[6] Alessandro Agnetis,et al. A linear algorithm for the Hamiltonian completion number of the line graph of a tree , 2001, Inf. Process. Lett..

[7] Arundhati Raychaudhuri. The Total Interval Number of a Tree and the Hamiltonian Completion Number of its Line Graph , 1995, Inf. Process. Lett..

[8] D. West. Introduction to Graph Theory , 1995 .

[9] Peter L. Hammer,et al. Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation , 1993, Artif. Intell..

[10] Peter L. Hammer,et al. Horn Functions and Their DNFs , 1992, Inf. Process. Lett..

[11] David Maier,et al. The Theory of Relational Databases , 1983 .

[12] Frank Harary,et al. Trees with Hamiltonian square , 1971 .