Loading...
Please wait, while we are loading the content...
Similar Documents
On Approximate Inclusion-Exclusion
| Content Provider | Semantic Scholar |
|---|---|
| Author | Klein, Andreas Metsch, Klaus |
| Copyright Year | 1995 |
| Abstract | In [1] N. Linial and N. Nisan use linear programming to reduce this question to questions in approximation theory and in particular to the theory of Chebyshev polynomials. Their bound is nearly optimal for m ≤ √ n, but for larger m the bound gets worse. In this paper we give an explicit bound for m = n−2 and improve the asymptotic bound for n = n− d, d fixed. As an application we will construct a contrast optimal (n− 1)-out-of-n visual cryptography scheme. |
| Starting Page | 249 |
| Ending Page | 270 |
| Page Count | 22 |
| File Format | PDF HTM / HTML |
| DOI | 10.2140/iig.2008.6.249 |
| Volume Number | 6 |
| Alternate Webpage(s) | https://msp.org/iig/2008/6-1/iig-v6-n1-p16-s.pdf |
| Alternate Webpage(s) | http://cage.ugent.be/~bamberg/abstracts/klein160207.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
