How to assign votes in a distributed system
Journal of the ACM (JACM)
Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
A theory of diagnosis from first principles
Artificial Intelligence
Dualization of regular Boolean functions
Discrete Applied Mathematics
An O(mn) algorithm for regular set-covering problems
Theoretical Computer Science
On generating all maximal independent sets
Information Processing Letters
Fast learning of k-term DNF formulas with queries
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
An O(nm)-time algorithm for computing the dual of a regular Boolean function
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Complexity of identification and dualization of positive Boolean functions
Information and Computation
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
SIAM Journal on Computing
The Maximum Latency and Identification of Positive Boolean Functions
SIAM Journal on Computing
A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
Journal of Algorithms
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
SIAM Journal on Computing
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Inferring Minimal Functional Dependencies in Horn and q-Horn Theories
Annals of Mathematics and Artificial Intelligence
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Polynominal Time Algorithms for Some Self-Duality Problems
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
Self-duality of bounded monotone boolean functions and related problems
Discrete Applied Mathematics
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
On the fractional chromatic number of monotone self-dual Boolean functions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.04 |
This paper shows that O(logn)-term monotone disjunctive normal forms (DNFs) φ can be dualized in incremental polynomial time, where n is the number of variables in φ. This improves upon the trivial result that k-term monotone DNFs can be dualized in polynomial time, where k is bounded by some constant.