This newly expanded and updated second edition of the best-selling classic continues to take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …
An Introduction to Cryptography | SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart Book cover An …
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available …
A Board, GAMBCS Calude, ACDHJ Hartmanis… - 2005 - Springer
This book is an accessible introduction to complexity theory and cryptology, two closely related areas in theoretical computer science. Based on courses taught at Heinrich-Heine …
This book is designed to serve as a basic text of modern algebra at the undergraduate level. Modern mathematics facilitates unification of different areas of mathematics. It is …
The systematic development of efficient algorithms has become a key technology for all kinds of ambitious and innovative computer applications. With major parts of algorithmic …
Computability Theory: An Introduction to Recursion Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory …
S Rameshnath, PK Bora - Multimedia Tools and Applications, 2019 - Springer
A perceptual video hash function extracts a short fixed-length bit string called a perceptual hash on the basis of the visual contents of the video. Such a function should be robust to the …
Wenn sich Studierende der Informatik oder verwandter Fächer in den ersten Wochen ihres Studiums befinden, wundern sie sich häufig, wie viele Lehrveranstaltungen der Mathematik …