Restricted Congruences in Computing
Autor Khodakhast Bibaken Limba Engleză Hardback – 25 sep 2020
This book introduces the tools that are needed when working on restricted congruences and then systematically studies a variety of restricted congruences. Restricted Congruences in Computing defines several types of restricted congruence, obtains explicit formulae for the number of their solutions using a wide range of tools and techniques, and discusses their applications in cryptography, information security, information theory, coding theory, string theory, quantum field theory, parallel computing, artificial intelligence, computational biology, discrete mathematics, number theory, and more.
This is the first book devoted to restricted congruences and their applications. It will be of interest to graduate students and researchers across computer science, electrical engineering, and mathematics.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 152.91 lei 22-36 zile | +8.18 lei 5-11 zile |
| CRC Press – 22 apr 2022 | 152.91 lei 22-36 zile | +8.18 lei 5-11 zile |
| Hardback (1) | 225.49 lei 22-36 zile | +15.36 lei 5-11 zile |
| CRC Press – 25 sep 2020 | 225.49 lei 22-36 zile | +15.36 lei 5-11 zile |
Preț: 225.49 lei
Preț vechi: 281.86 lei
-20% Nou
Puncte Express: 338
Preț estimativ în valută:
43.15€ • 44.83$ • 35.85£
43.15€ • 44.83$ • 35.85£
Carte disponibilă
Livrare economică 13-27 ianuarie 25
Livrare express 27 decembrie 24 - 02 ianuarie 25 pentru 25.35 lei
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780367496036
ISBN-10: 0367496038
Pagini: 157
Dimensiuni: 138 x 216 x 11 mm
Greutate: 0.3 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
ISBN-10: 0367496038
Pagini: 157
Dimensiuni: 138 x 216 x 11 mm
Greutate: 0.3 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
V-ar putea interesa
-
-26%Preț: 880.31 lei1181.71 lei -
Computational Science and its ApplicationsA. H. Siddiqi-20%Preț: 1150.79 lei1438.49 lei -
2⁵ Problems for STEM EducationValery Ochkov-30%Preț: 492.68 lei704.78 lei -
Formal Languages and Computation: Models and Their ApplicationsAlexander Meduna-20%Preț: 443.00 lei553.74 lei -
Business Economics and Finance with MATLAB, GIS, and Simulation ModelsPatrick L. Anderson-15%Preț: 479.40 lei564.00 lei -
Numerical Solution of Ordinary Differential EquationsL.F. Shampine-20%Preț: 455.24 lei569.05 lei -
Arc-Search Techniques for Interior-Point MethodsYaguang Yang-20%Preț: 1034.28 lei1292.85 lei -
Handbook of Parallel Computing and StatisticsErricos John Kontoghiorghes-31%Preț: 264.89 lei381.73 lei -
Mathematical Principles of the Internet, Volume 1: EngineeringNirdosh Bhatnagar-24%Preț: 297.64 lei391.02 lei -
-20%Preț: 642.77 lei803.46 lei -
-20%Preț: 338.31 lei422.89 lei -
-20%Preț: 325.38 lei406.73 lei -
-20%Preț: 327.47 lei409.34 lei -
Preț: 390.88 lei -
-20%Preț: 331.04 lei413.81 lei -
Preț: 389.61 lei -
-20%Preț: 324.09 lei405.12 lei -
-20%Preț: 329.58 lei411.98 lei -
Preț: 379.42 lei -
-20%Preț: 343.01 lei428.77 lei -
Preț: 387.70 lei -
Preț: 388.66 lei -
-20%Preț: 328.93 lei411.17 lei -
-20%Preț: 535.59 lei669.49 lei -
-20%Preț: 321.49 lei401.87 lei -
-20%Preț: 336.54 lei420.67 lei -
-20%Preț: 327.66 lei409.58 lei -
-20%Preț: 328.76 lei410.95 lei
Public țintă
PostgraduateCuprins
Preface
Dedication
1 Introduction
1.1 Motivation
1.2 Overview of the book
2 The Restricted Congruences Toolbox 6
2.1 Ramanujan sums
2.2 Some useful identities
2.3 The discrete Fourier transform
2.4 Universal hashing and its variants
2.5 Multilinear Modular Hashing
2.6 Fuchsian groups and Harvey's theorem
2.7 Counting epimorphisms via homomorphisms
2.8 Generating functions for graph enumeration
2.9 Deletion correcting codes
2.10 Weight enumerator of a code
2.11 Gaussian integers, spectral graph theory, characters
3 The GCD-Restricted Linear Congruences
3.1 Introduction
3.2 Linear congruences with
3.3 An equivalent form of Theorem 3.2.4
3.4 Some problems
4 Applications in Universal Hashing and Authentication with Secrecy
4.1 Introduction
4.2 Generalized Multilinear Modular Hashing
4.3 GRDH
4.4 Applications to authentication with secrecy
4.5 Discussion
5 Applications in String Theory and Quantum Field Theory
5.1 Introduction
5.2 Counting surface-kernel epimorphisms from Γ to Zn
5.3 A problem
6 Alldiff Congruences, Graph Theoretic Method, and Beyond
6.1 Introduction
6.2 Graph theoretic method
6.3 Unweighted alldiff congruences
6.4 More applications and connections
6.5 A problem
7 Alldiff Congruences Meet VT Codes
7.1 Introduction
7.2 Main results
8 Binary Linear Congruence Code
8.1 Introduction
8.2 Weight enumerator of the Binary Linear Congruence Code
8.3 Weight enumerators of the aforementioned codes
9 Applications in Parallel Computing, AI, etc
9.1 Application in parallel computing
9.2 Application in arti□ficial intelligence and computational biology
9.3 Application in the Subset-Sum Problem
10 Quadratic Congruences, Ramanujan Graphs, and the Golomb-Welch Conjecture
10.1 Introduction
10.2 Quadratic congruences
10.3 Proof of the conjecture
10.4 A problem
Bibliography
Index
Dedication
1 Introduction
1.1 Motivation
1.2 Overview of the book
2 The Restricted Congruences Toolbox 6
2.1 Ramanujan sums
2.2 Some useful identities
2.3 The discrete Fourier transform
2.4 Universal hashing and its variants
2.5 Multilinear Modular Hashing
2.6 Fuchsian groups and Harvey's theorem
2.7 Counting epimorphisms via homomorphisms
2.8 Generating functions for graph enumeration
2.9 Deletion correcting codes
2.10 Weight enumerator of a code
2.11 Gaussian integers, spectral graph theory, characters
3 The GCD-Restricted Linear Congruences
3.1 Introduction
3.2 Linear congruences with
3.3 An equivalent form of Theorem 3.2.4
3.4 Some problems
4 Applications in Universal Hashing and Authentication with Secrecy
4.1 Introduction
4.2 Generalized Multilinear Modular Hashing
4.3 GRDH
4.4 Applications to authentication with secrecy
4.5 Discussion
5 Applications in String Theory and Quantum Field Theory
5.1 Introduction
5.2 Counting surface-kernel epimorphisms from Γ to Zn
5.3 A problem
6 Alldiff Congruences, Graph Theoretic Method, and Beyond
6.1 Introduction
6.2 Graph theoretic method
6.3 Unweighted alldiff congruences
6.4 More applications and connections
6.5 A problem
7 Alldiff Congruences Meet VT Codes
7.1 Introduction
7.2 Main results
8 Binary Linear Congruence Code
8.1 Introduction
8.2 Weight enumerator of the Binary Linear Congruence Code
8.3 Weight enumerators of the aforementioned codes
9 Applications in Parallel Computing, AI, etc
9.1 Application in parallel computing
9.2 Application in arti□ficial intelligence and computational biology
9.3 Application in the Subset-Sum Problem
10 Quadratic Congruences, Ramanujan Graphs, and the Golomb-Welch Conjecture
10.1 Introduction
10.2 Quadratic congruences
10.3 Proof of the conjecture
10.4 A problem
Bibliography
Index
Notă biografică
Khodakhast Bibak is an Assistant Professor at the Department of Computer Science and Software Engineering at Miami University. He was a Postdoctoral Research Associate at the University of Illinois, Urbana-Champaign, and a Postdoctoral Research Fellow at the University of Victoria, where he also received his PhD (2017). Dr. Bibak previously studied at the University of Waterloo, where he was also a member of the Centre for Applied Cryptographic Research (CACR).
Descriere
As the first book of its kind, this book is devoted to studying congruences, their problems and applications. The book will be of interest to graduate students and researchers across computer science, electrical engineering, and mathematics.