Skip to main content
Book Chapter

On Horn envelopes and hypergraph transversals

  • Kavvadias D
  • Papadimitriou C
  • Sideri M
DOI: 10.1007/3-540-57568-5_271
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the problem of bounding from above and below a given set of bit vectors by the set of satisfying truth assignments of a Horn formula. We point out a rather unexpected connection between the upper bounding problem and the problem of generating all transversals of a hypergraph, and settle several related complexity questions.

Cite

CITATION STYLE

APA

Kavvadias, D., Papadimitriou, C. H., & Sideri, M. (1993). On Horn envelopes and hypergraph transversals (pp. 399–405). https://doi.org/10.1007/3-540-57568-5_271

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free