✦ LIBER ✦

Upper and Lower Bounds on Black-Box Steganography

✍ Scribed by Nenad Dedić; Gene Itkis; Leonid Reyzin; Scott Russell

Book ID: 105839906
Publisher: Springer
Year: 2008
Tongue: English
Weight: 446 KB
Volume: 22
Category: Article
ISSN: 0933-2790
DOI: 10.1007/s00145-008-9020-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper and Lower Bounds for Randomized Se

Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization

✍ Stefan Droste; Thomas Jansen; Ingo Wegener 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 237 KB

On lower and upper bounds of matrices

✍ Peng Gao 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.

Lower and upper bounds on the fidelity s

Lower and upper bounds on the fidelity susceptibility

✍ Brankov, J.; Tonchev, N. 📂 Article 📅 2012 🏛 The American Physical Society 🌐 English ⚖ 183 KB

Upper and lower bounds for eigenvalues

✍ Walter Leighton 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Upper and lower bounds to eigenvalues

✍ R. P. Messmer; F. W. Birss 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 277 KB