The Complexity of the Union of (alpha, beta)-Covered Objects

Alon Efrat. The Complexity of the Union of (alpha, beta)-Covered Objects. SIAM Journal on Computing, 34(4):775-787, 2005. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.