Kategoria BISAC: Mathematics >> Discrete Mathematics

Informatikerinnen und Informatiker aller Fachrichtungen mussen die grundlegenden Konzepte, Methoden und Verfahren, die der Entwicklung und dem Einsatz von Informations- und Kommunikationstechnologien zugrunde liegen, verstehen und bei der Losung von Problemen anwenden konnen. Das Buch stellt die algebraischen und zahlentheoretischen Grundlagen dafur vor und wendet diese bei der Losung praktischer Problemstellungen, wie modulare Arithmetik, Primzahltests und Verschlusselung an. Das Verstandnis der Begriffe und deren Zusammenhange und Zusammenwirken wird u.a. durch Lernziele, integrierte...

Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research.

The volume is recommended to experienced...

Mathematica is today s most advanced technical computing system. It features a rich programming environment, two-and three-dimensional graphics capabilities and hundreds of sophisticated, powerful programming and mathematical functions using state-of-the-art algorithms. Combined with a user-friendly interface, and a complete mathematical typesetting system, Mathematica offers an intuitive, easy-to-handle environment of great power and utility.

The Mathematica Guidebook for Programming provides a comprehensive, step-by-step development of Mathematica programming capabilities and...

Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today s most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods.
This important new work is edited by Miklos Bona of the University of Florida where he is a member of the Academy of Distinguished Teaching Scholars. He received his Ph.D. in mathematics at Massachusetts Institute of Technology in 1997. Miklos is the author of four books and more than 65 research articles, including the...

Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal, nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics, coding theory, and cryptography, the text provides a detailed survey of their main results, presenting a systematic overview of their generalizations and applications, and considering open problems in classification and systematization of bent functions.

The text is appropriate for...

This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014.

The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory...