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
Acta Cybernetica
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
The complexity of parallel search
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Computational learning theory: an introduction
Computational learning theory: an introduction
An O(nm)-time algorithm for computing the dual of a regular Boolean function
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Exact transversal hypergraphs and application to Boolean &mgr;-functions
Journal of Symbolic Computation
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
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
The Maximum Latency and Identification of Positive Boolean Functions
SIAM Journal on Computing
Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
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
Almost all monotone Boolean functions are polynomially learnable using membership queries
Information Processing Letters
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
New Results on Monotone Dualization and Generating Hypergraph Transversals
SIAM Journal on Computing
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
Monotone boolean dualization is in co-NP[log2n]
Information Processing Letters
NP-Completeness: A Retrospective
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
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
An inequality for polymatroid functions and its applications
Discrete Applied Mathematics - Submodularity
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the Complexity of Some Enumeration Problems for Matroids
SIAM Journal on Discrete Mathematics
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
On the complexity of the multiplication method for monotone CNF/DNF dualization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Transactions on rough sets XII
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.04 |
In 1994 Fredman and Khachiyan established the remarkable result that the duality of a pair of monotone Boolean functions, in disjunctive normal forms, can be tested in quasi-polynomial time, thus putting the problem, most likely, somewhere between polynomiality and coNP-completeness. We strengthen this result by showing that the duality testing problem can in fact be solved in polylogarithmic time using a quasi-polynomial number of processors (in the PRAM model). While our decomposition technique can be thought of as a generalization of that of Fredman and Khachiyan, it yields stronger bounds on the sequential complexity of the problem in the case when the sizes of f and g are significantly different, and also allows for generating all minimal transversals of a given hypergraph using only polynomial space.