Pages that link to "Item:Q955349"
From MaRDI portal
The following pages link to The complexity of unions of disjoint sets (Q955349):
Displaying 15 items.
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Union-freeness, deterministic union-freeness and union-complexity (Q2179325) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- Probabilistic Analysis of Disjoint Set Union Algorithms (Q3142595) (← links)
- (Q3685219) (← links)
- On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem (Q3756517) (← links)
- (Q3785940) (← links)
- (Q4038696) (← links)
- Complexity of Recognizing Equal Unions in Families of Sets (Q4521526) (← links)
- Epsilon nets and union complexity (Q5370694) (← links)
- Unions of Disjoint NP-Complete Sets (Q5892145) (← links)
- Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)