On the complexity of enumerating pseudo-intents
Authors:
- Felix DistelFDFelix Distel
- Barış SertkayaBSBarış Sertkaya
- 1 March 2011
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (6) , 450-466
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Computational aspects of monotone dualization: A brief surveyDiscrete Applied Mathematics, 2008
- Minimum implicational basis for ∧-semidistributive latticesInformation Processing Letters, 2006
- New Results on Monotone Dualization and Generating Hypergraph TransversalsSIAM Journal on Computing, 2003
- New results on monotone dualization and generating hypergraph transversals2002
- Data mining, hypergraph transversals, and machine learning (extended abstract)1997
- On the Complexity of Dualization of Monotone Disjunctive Normal FormsJournal of Algorithms, 1996
- Identifying the Minimal Transversals of a Hypergraph and Related ProblemsSIAM Journal on Computing, 1995
- The core of finite latticesDiscrete Mathematics, 1991
- On generating all maximal independent setsInformation Processing Letters, 1988
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984