New results on monotone dualization and generating hypergraph transversals

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 14-22

  Eiter, Thomas ^a   Gottlob, Georg ^a   Makino, Kazuhisa ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

Combinatorial enumeration; Dualization; Hypergraph acyclicity; Limited nondeterminism; Output polynomial algorithms; Transversal computation; Treewidth

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DATA MINING; DATABASE SYSTEMS; DECISION THEORY; GAME THEORY; LEARNING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

HYPERGRAPH; MONOTONE DUALIZATION; POLYNOMIAL TIME;

GRAPH THEORY;

EID: 0036036671     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509912     Document Type: Conference Paper

References (45)

1. Molecular computing, bounded nondeterminism, and efficient recursion
2. Complexity of identification and dualization of positive Boolean functions
3. On generating all minimal integer solutions for a monotone system of linear inequalities
4. Dual-bounded generating problems: Partial and multiple transversals of a Hypergraph
5. On the complexity of generating maximal frequent and minimal infrequent sets
6. Dual subimplicants of positive Boolean functions
7. Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle
8. Dualization of regular Boolean functions
9. Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
10. Conjunctive query containment revisited
11. Exact transversal hypergraphs and application to Boolean μ-functions
12. Identifying the minimal transversals of a hypergraph and related problems
13. Degrees of acyclicity for hypergraphs and relational database schemes
14. On the complexity of dualization of monotone disjunctive normal forms
15. How to assign votes in a distributed system
16. Incremental recompilation of knowledge
17. Data mining, hypergraph transversals, and machine learning
18. Limited nondeterminism
19. Hypertree decompositions and tractable queries
20. On the universal relation
21. Nash-solvability of games in pure strategies
22. A theory of coteries: Mutual exclusion in distributed systems
23. On Horn envelopes and hypergraph transversals
24. Translating between horn representations and their characteristics models
25. Open and closed problems in NP-completeness
26. On generating all maximal independent sets
27. Refining nondeterminism in relativized polynomial-time bounded computations
28. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms
29. Combinationatorial optimization: Some problems and trends
30. The maximum latency and identification of positive Boolean functions
31. A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
32. Efficient dualization of O(log n) term monotone disjunctive normal forms
33. Design by example: An application of Armstrong relations
34. Generating all maximal independent sets of bounded-degree hypergraphs
35. NP-completeness: A retrospective
36. An O(nm)-time algorithms for computing the dual of a regular Boolean function
37. Every one a winner, or how to avoid isomorphism when cataloging combinatorial configurations
38. A theory of diagnosis from first principles
39. Graph minors II: Algorithmic aspects of tree-width
40. Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs
41. Minimal keys and antikeys
42. Colouring, stables sets and perfect graphs
43. An algorithm for tree-query membership of a distributed query