How to assign votes in a distributed system
Journal of the ACM (JACM)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
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
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
The Maximum Latency and Identification of Positive Boolean Functions
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Polynominal Time Algorithms for Some Self-Duality Problems
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Graphs and Hypergraphs
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
In this paper we show the equivalence between the problem of determining self-duality of a boolean function in DNF and a special type of satisfiability problem called NAESPI. Eiter and Gottlob [8] use a result from [2] to show that self-duality of monotone boolean functions which have bounded clause sizes (by some constant) can be determined in polynomial time. We show that the self-duality of instances in the class studied by Eiter and Gottlob can be determined in time linear in the number of clauses in the input, thereby strengthening their result. Domingo [7] recently showed that self-duality of boolean functions where each clause is bounded by (√log n) can be solved in polynomial time. Our linear time algorithm for solving the clauses with bounded size infact solves the (√log n) bounded self-duality problem in O(n2 √log n) time, which is better bound then the algorithm of Domingo [7], O(n3). Another class of self-dual functions arising naturally in application domain has the property that every pair of terms in f intersect in at most constant number of variables. The equivalent subclass of NAESPI is the c-bounded NAESPI. We also show that c-bounded NAESPI can be solved in polynomial time when c is some constant. We also give an alternative characterization of almost self-dual functions proposed by Bioch and Ibaraki [5] in terms of NAESPI instances which admit solutions of a 'particular' type.