Combinatorial optimization, along with graph algorithms and complexity theory is on the increase in the late-1990s. This book treats the most prominent problems which are polynomially solvable. The Travelling Salesman Problem is discussed as a paradigm of an NP-complete problem.
The book focuses on the advancements in design theory, reflecting significant developments since the first edition. It emphasizes the increasing relevance of discrete mathematics in engineering and science, highlighted by a new chapter dedicated to practical applications. Targeted at advanced students and researchers, it serves as a comprehensive reference for those in discrete mathematics, computer, and communications engineering. The volume includes exercises and an extensive bibliography with over 1800 citations, enhancing its utility for mathematical disciplines.
The book offers a comprehensive exploration of finite fields, emphasizing their foundational aspects and algebraic closures. It introduces advanced topics rarely covered in textbooks, such as the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for polynomial factorization over finite fields. This self-contained monograph is designed for readers seeking a deeper understanding of these complex mathematical concepts.
The proceedings of the 5th International Conference on Finite Fields and Applications look at the applications of finite fields, ranging from combinatorial design theory, finite geometries, and algebraic geometry to coding theory, cryptology, and scientific computing.
Anschaulicher Ansatz: Gemeinsame Behandlung von diskreten und kontinuierlichen Methoden Leichter Einstieg für Studenten Aktueller Überblick zu Detailfragen