Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Ekin:1997:HFS, author = "Oya Ekin and Peter L. Hammer and Uri N. Peled", title = "{Horn} functions and submodular {Boolean} functions", journal = j-THEOR-COMP-SCI, volume = "175", number = "2", pages = "257--270", day = "10", month = apr, year = "1997", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:20:46 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=175&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=175&issue=2&aid=2404", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240C (Computational complexity)", corpsource = "RUTCOR, Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean functions; computational complexity; coNP-complete; Horn DNF; Horn functions; maximal antichains; prime implicants", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }