Vol. 6, No. 1, 2008

Download this article
Download this article For screen
For printing
Recent Issues
Volume 17, Issue 2
Volume 17, Issue 1
Volume 16, Issue 1
Volume 15, Issue 1
Volume 14, Issue 1
Volume 13, Issue 1
Volume 12, Issue 1
Volume 11, Issue 1
Volume 10, Issue 1
Volume 9, Issue 1
Volume 8, Issue 1
Volume 6+7, Issue 1
Volume 5, Issue 1
Volume 4, Issue 1
Volume 3, Issue 1
Volume 2, Issue 1
Volume 1, Issue 1
The Journal
About the Journal
Subscriptions
Editorial Board
Submission Guidelines
Submission Form
Ethics Statement
To Appear
Editorial Login
Contacts
ISSN (electronic): 2640-7345
ISSN (print): 2640-7337
Other MSP Journals
On approximate inclusion-exclusion

Andreas Klein and Klaus Metsch

Vol. 6 (2008), No. 1, 249–270
DOI: 10.2140/iig.2008.6.249
Abstract

The inclusion-exclusion formula expresses the size of the union of a family of sets in terms of the sizes of intersections of all subfamilies. N. Linial and N. Nisan use linear programming to approximate the size of the union when the intersection sizes are known only for certain subfamilies. In this article we use purely combinatorial methods to generalize some of their results. As an application we will construct a contrast optimal (n 1)-out-of-n visual cryptography scheme.

Keywords
inclusion-exclusion formula, visual cryptography
Mathematical Subject Classification 2000
Primary: 05A20, 68P25
Milestones
Received: 5 February 2008
Accepted: 14 April 2008
Authors
Andreas Klein
Klaus Metsch