On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
Authors:
- 1 October 1999
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 96-97, 363-373
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- 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
- Complexity of Identification and Dualization of Positive Boolean FunctionsInformation and Computation, 1995
- An O(nm)-time algorithm for computing the dual of a regular Boolean functionDiscrete Applied Mathematics, 1994
- Combinatorial characterization of read-once formulaeDiscrete Mathematics, 1993
- On generating all maximal independent setsInformation Processing Letters, 1988
- Dualization of regular Boolean functionsDiscrete Applied Mathematics, 1987
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- The solvability of positional games in pure strategiesUSSR Computational Mathematics and Mathematical Physics, 1975
- On theory of multistep gamesUSSR Computational Mathematics and Mathematical Physics, 1973