The Complexity of Unions of Disjoint Sets

DOI10.1007/978-3-540-70918-3_22MaRDI QIDQ3590939zbMATH OpenOpenAlexFDO

Authors Christian Glaßer, Alan L. Selman, Stephen Travers, K. W. Wagner

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_22

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• The complexity of unions of disjoint sets
• Unions of disjoint NP-complete sets
• Unions of disjoint NP-complete sets
• Disjoint NP-Pairs
• Reductions between disjoint NP-pairs

Cited in

(15)

• Unions of disjoint NP-complete sets
• Unions of disjoint NP-complete sets
• On the complexity of data disjunctions.
• scientific article; zbMATH DE number 177818 (Why is no real title available?)
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
• Union-freeness, deterministic union-freeness and union-complexity
• Epsilon nets and union complexity
• Tuples of disjoint \(\mathsf{NP}\)-sets
• Complexity of Recognizing Equal Unions in Families of Sets
• The complexity of dissociation set problems in graphs
• A linear-time algorithm for a special case of disjoint set union
• scientific article; zbMATH DE number 3907792 (Why is no real title available?)
• scientific article; zbMATH DE number 4049047 (Why is no real title available?)
• Probabilistic Analysis of Disjoint Set Union Algorithms
• The complexity of unions of disjoint sets

This page was built for publication: The Complexity of Unions of Disjoint Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590939)