Horn renamability and hypergraphs

被引：1

作者：

Hvalica, Dušan ^{[1
]}

机构：

[1] Faculty of Economics, University of Ljubljana, Kardeljeva ploščad 17, Ljubljana,SI - 1000, Slovenia

来源：

Journal of Computing and Information Technology | 2009年 / 17卷 / 04期

关键词：

D O I：

10.2498/cit.1001287

中图分类号：

学科分类号：

摘要：

引用

页码：307 / 312

共 50 条

[1] Horn renamability testing in the context of hypergraphs
Hvalica, Dusan
SOR'07: PROCEEDINGS OF THE 9TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2007, : 51 - 56
[2] Horn renamability and B-GRAPHS
Hvalica, Dusan
SOR'07: PROCEEDINGS OF THE 9TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2007, : 57 - 62
[3] The Horn renamability, q-Horn and SLUR threshold for random k-CNF formulas
Chao, D.
DISCRETE APPLIED MATHEMATICS, 2015, 185 : 44 - 51
[4] Directed hypergraphs and Horn minimization
Berczi, Kristof
Berczi-Kovacs, Erika R.
INFORMATION PROCESSING LETTERS, 2017, 128 : 32 - 37
[5] Hydras: Directed hypergraphs and Horn formulas
Sloan, Robert H.
Stasi, Despina
Turan, Gyorgy
THEORETICAL COMPUTER SCIENCE, 2017, 658 : 417 - 428
[6] Hydras: Directed Hypergraphs and Horn Formulas
Sloan, Robert H.
Stasi, Despina
Turan, Gyoergy
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2012, 7551 : 237 - 248
[7] Axiomatisability and hardness for universal Horn classes of hypergraphs
Ham, Lucy
Jackson, Marcel
ALGEBRA UNIVERSALIS, 2018, 79 (02)
[8] Axiomatisability and hardness for universal Horn classes of hypergraphs
Lucy Ham
Marcel Jackson
Algebra universalis, 2018, 79
[9] Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs
Sloan, Robert H.
Stasi, Despina
Turan, Gyoergy
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2012, 14 (02): : 29 - 35
[10] Max Horn SAT and the minimum cut problem in directed hypergraphs
G. Gallo
C. Gentile
D. Pretolani
G. Rago
Mathematical Programming, 1998, 80 : 213 - 237

← 1 2 3 4 5 →