Posted by **interes** at Feb. 4, 2017

English | September 25, 2002 | ISBN: 0072474777 | Pages: 502 | DJVU | 5.2 MB

Posted by **roxul** at July 29, 2016

English | 1999 | ISBN: 9814021725 | 122 pages | PDF | 0,5 MB

Posted by **fdts** at Dec. 9, 2015

by Kenneth Rosen

English | 2011 | ISBN: 0073383090 | 1072 pages | PDF | 9.64 MB

Posted by **tanas.olesya** at Sept. 8, 2015

English | 16 Oct. 1996 | ISBN: 8189836129 | ASIN: 0849385237 | 794 Pages | PDF | 4 MB

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications.

Posted by **tanas.olesya** at March 24, 2015

English | Dec 29, 2003 | ISBN: 8126541067 | ASIN: 1584880902 | 1155 Pages | PDF | 9 MB

The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published.

Posted by **manamba13** at Feb. 4, 2015

English | 2014 | ISBN: 1118306082 | 512 Pages | PDF | 3 MB

Providing the basic theory and methods that are essential for understanding complexity theory, this second edition of Theory of Computational Complexity emphasizes advances in the field of computational complexity, including newly developed algorithms and novel applications to quantum computing.

Posted by **tanas.olesya** at Dec. 4, 2014

English | April 21, 2000 | ISBN: 0849385253 | 246 pages | PDF | 4 MB

The demand for digital speech coding algorithms grows every day, fueled by applications such as streaming speech over the Internet, Internet telephone, digital cellular telephony, wireless teleconferencing, and various multimedia applications. Until now, most of the books available on audio coding have been collections of individually authored papers.

Posted by **tanas.olesya** at Dec. 1, 2014

English | June 25, 2004 | ISBN: 1584884347 | 383 pages | PDF | 5 MB

As linear orders, as elements of the symmetric group, modeled by matrices, modeled by graphsâ€¦permutations are omnipresent in modern combinatorics. They are omnipresent but also multifaceted, and while several excellent books explore particular aspects of the subject, no one book has covered them all. Even the classic results are scattered in various resources.

Posted by **tanas.olesya** at Nov. 17, 2014

Wiley-Interscience; 2 edition | August 24, 2000 | English | ISBN: 0471370460 | 319 pages | PDF | 1 MB

The leading reference on probabilistic methods in combinatorics-now expanded and updated. When it was first published in 1991, The Probabilistic Method became instantly the standard reference on one of the most powerful and widely used tools in combinatorics.

Posted by **zxcvbn** at Oct. 14, 2014

Kenneth H. Rosen | 2006 | PDF | ISBN: 0072880082, 0071244743 | 997 pages | 178Mb