Restricted Congruences in Computing

This book explores the tools and techniques for finding solutions to restricted congruences, which are common in computer science, engineering, mathematics, and related areas. It discusses various types of restricted congruences, their explicit formulae for the number of solutions, and 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.

Format: Hardback
Length: 145 pages
Publication date: 01 October 2020
Publisher: Taylor & Francis Ltd

Congruences are fundamental concepts in computer science, engineering, mathematics, and related fields. The study of finding solutions to congruences is a crucial problem, but in many scenarios, we are only interested in a subset of these solutions, with certain restrictions imposed. This book provides the necessary tools for working with restricted congruences and systematically investigates a diverse range of such congruences.

Restricted Congruences in Computing introduces several types of restricted congruences, derives explicit formulas for the number of their solutions using a wide array of techniques, and explores 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 other fields.

This book is the first dedicated to restricted congruences and their applications. It will appeal to graduate students and researchers in computer science, electrical engineering, and mathematics.

Weight: 316g
Dimension: 144 x 222 x 15 (mm)
ISBN-13: 9780367496036