𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Hardness of Computing Intersection, Union and

✍ Scribed by Hans Raj Tiwary

Publisher
Springer
Year
2008
Tongue
English
Weight
317 KB
Volume
40
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on fuzzy union and fuzzy intersec
A note on fuzzy union and fuzzy intersection
✍ Kankana Chakrabarty; Ranjit Biswas; Sudarsan Nanda πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 242 KB

This note is a study on the generalization of the notion of union and intersection of two fuzzy sets as laid down by Prof. Zadeh in his classical work Zadeh (1965). Some existing propositions are surveyed with this generalized notion.

Computing the intersection-depth of poly
Computing the intersection-depth of polyhedra
✍ David Dobkin; John Hershberger; David Kirkpatrick; Subhash Suri πŸ“‚ Article πŸ“… 1993 πŸ› Springer 🌐 English βš– 1023 KB
On families of finite sets with bounds o
On families of finite sets with bounds on unions and intersections
✍ Chang Bang; Henry Sharp Jr.; Peter Winkler πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 364 KB

We present a conjecture, with some supporting results, concerning the maximum size of a family of subsets satisfying the following conditions: the intersection of any two members of the family has cardinal@ at least s, and the intersection of the complements of any two members has cardinal@ at least