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
Decompositions of positive self-dual Boolean functions
Discrete Mathematics
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
Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The Maximum Latency and Identification of Positive Boolean Functions
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
Graphs and Hypergraphs
| Hi-index | 0.04 |
In this paper we examine the problem of determining the self-duality of a monotone boolean function in disjunctive normal form (DNF). We show that the self-duality of monotone boolean functions with n disjuncts such that each disjunct has at most k literals can be determined in O(2^k^^^2k^2n) time. This implies an O(n^2logn) algorithm for determining the self-duality of logn-DNF functions. We also consider the version where any two disjuncts have at most c literals in common. For this case we give an O(n^4^(^c^+^1^)) algorithm for determining self-duality.