On the complexity of sign-nonsingularity and equal unions of sets

Authors:
David P. Jacobs;Robert E. Jamison;Alice A. McRae
Affiliations:
Clemson University, Clemson, SC;Clemson University, Clemson, SC;Appalachian State Univ., Boone, NC
Venue:
ACM-SE 38 Proceedings of the 38th annual on Southeast regional conference
Year:
2000

Citing 3
Cited 1

Permanents, Pfaffian orientations, and even directed circuits (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A note on equal unions in families of sets

Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Polynomial recognition of equal unions in hypergraphs with few vertices of large degree

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A family of nonempty sets has the equal union property (EUP) if and only if there exist two nonempty disjoint subfamilies having the same union. If, in addition, every set in the family is used, we have the full equal union property (FEUP). A family with more sets than points always has the equal union property. On the other hand, if there are more points than sets, recognizing both the EUP and FEUP is NP-complete. A recent striking and difficult result by Robertson, Seymour, Thomas, and independently, McCuaig, implies that for square families (the same number of sets as points) recognition of the EUP is polynomial-time. In contrast to this, we give a simple argument below to show that FEUP is NP-complete in the square case.