hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1001287

Horn Renamability and Hypergraphs

Dušan Hvalica

Puni tekst: engleski, pdf (162 KB) str. 307-312 preuzimanja: 351* citiraj
APA 6th Edition
Hvalica, D. (2009). Horn Renamability and Hypergraphs. Journal of computing and information technology, 17 (4), 307-312. https://doi.org/10.2498/cit.1001287
MLA 8th Edition
Hvalica, Dušan. "Horn Renamability and Hypergraphs." Journal of computing and information technology, vol. 17, br. 4, 2009, str. 307-312. https://doi.org/10.2498/cit.1001287. Citirano 27.02.2021.
Chicago 17th Edition
Hvalica, Dušan. "Horn Renamability and Hypergraphs." Journal of computing and information technology 17, br. 4 (2009): 307-312. https://doi.org/10.2498/cit.1001287
Harvard
Hvalica, D. (2009). 'Horn Renamability and Hypergraphs', Journal of computing and information technology, 17(4), str. 307-312. https://doi.org/10.2498/cit.1001287
Vancouver
Hvalica D. Horn Renamability and Hypergraphs. Journal of computing and information technology [Internet]. 2009 [pristupljeno 27.02.2021.];17(4):307-312. https://doi.org/10.2498/cit.1001287
IEEE
D. Hvalica, "Horn Renamability and Hypergraphs", Journal of computing and information technology, vol.17, br. 4, str. 307-312, 2009. [Online]. https://doi.org/10.2498/cit.1001287

Sažetak
Satisfiability testing in the context of directed hypergraphs is discussed. A characterization of Horn-renamable formulae is given and a subclass of SAT that belongs to $\QTR{cal}{P}$ is described. An algorithm for Horn renaming with linear time complexity is presented.

Hrčak ID: 51554

URI
https://hrcak.srce.hr/51554

Posjeta: 520 *