Restricted Congruences in Computing
Restricted Congruences in Computing

Author: Khodakhast Bibak

Publisher: CRC Press

Published: 2020-09-24

Total Pages: 159

ISBN-13: 1000173038

DOWNLOAD EBOOK

Congruences are ubiquitous in computer science, engineering, mathematics, and related areas. Developing techniques for finding (the number of) solutions of congruences is an important problem. But there are many scenarios in which we are interested in only a subset of the solutions; in other words, there are some restrictions. What do we know about these restricted congruences, their solutions, and applications? 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.

Restricted Congruences in Computing
Restricted Congruences in Computing

Author: Khodakhast Bibak

Publisher: CRC Press

Published: 2020-09-28

Total Pages: 79

ISBN-13: 1000173135

DOWNLOAD EBOOK

Congruences are ubiquitous in computer science, engineering, mathematics, and related areas. Developing techniques for finding (the number of) solutions of congruences is an important problem. But there are many scenarios in which we are interested in only a subset of the solutions; in other words, there are some restrictions. What do we know about these restricted congruences, their solutions, and applications? 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.

Universal Algebra and Applications in Theoretical Computer Science
Universal Algebra and Applications in Theoretical Computer Science

Author: Klaus Denecke

Publisher: CRC Press

Published: 2018-10-03

Total Pages: 396

ISBN-13: 1482285835

DOWNLOAD EBOOK

Over the past 20 years, the emergence of clone theory, hyperequational theory, commutator theory and tame congruence theory has led to a growth of universal algebra both in richness and in applications, especially in computer science. Yet most of the classic books on the subject are long out of print and, to date, no other book has integrated these theories with the long-established work that supports them. Universal Algebra and Applications in Theoretical Computer Science introduces the basic concepts of universal algebra and surveys some of the newer developments in the field. The first half of the book provides a solid grounding in the core material. A leisurely pace, careful exposition, numerous examples, and exercises combine to form an introduction to the subject ideal for beginning graduate students or researchers from other areas. The second half of the book focuses on applications in theoretical computer science and advanced topics, including Mal'cev conditions, tame congruence theory, clones, and commutators. The impact of the advances in universal algebra on computer science is just beginning to be realized, and the field will undoubtedly continue to grow and mature. Universal Algebra and Applications in Theoretical Computer Science forms an outstanding text and offers a unique opportunity to build the foundation needed for further developments in its theory and in its computer science applications.

Mathematical Foundations of Computer Science 1991
Mathematical Foundations of Computer Science 1991

Author: Andrzej Tarlecki

Publisher: Springer Science & Business Media

Published: 1991-08-07

Total Pages: 458

ISBN-13: 9783540543459

DOWNLOAD EBOOK

This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.

The Congruences of a Finite Lattice
The Congruences of a Finite Lattice

Author: George Grätzer

Publisher: Springer Nature

Published: 2023-03-23

Total Pages: 440

ISBN-13: 3031290631

DOWNLOAD EBOOK

The congruences of a lattice form the congruence lattice. Over the last several decades, the study of congruence lattices has established itself as a large and important field with a great number of interesting and deep results, as well as many open problems. Written by one of the leading experts in lattice theory, this text provides a self-contained introduction to congruences of finite lattices and presents the major results of the last 90 years. It features the author’s signature “Proof-by-Picture” method, which is used to convey the ideas behind formal proofs in a visual, more intuitive manner. Key features include: an insightful discussion of techniques to construct "nice" finite lattices with given congruence lattices and "nice" congruence-preserving extensions complete proofs, an extensive bibliography and index, and over 180 illustrations additional chapters covering new results of the last seven years, increasing the size of this edition to 430 pages, 360 statements, and 262 references This text is appropriate for a one-semester graduate course in lattice theory, and it will also serve as a valuable reference for researchers studying lattices. Reviews of previous editions: “[This] monograph...is an exceptional work in lattice theory, like all the contributions by this author. The way this book is written makes it extremely interesting for the specialists in the field but also for the students in lattice theory. — Cosmin Pelea, Studia Universitatis Babes-Bolyai Mathematica LII (1), 2007 "The book is self-contained, with many detailed proofs presented that can be followed step-by-step. I believe that this book is a much-needed tool for any mathematician wishing a gentle introduction to the field of congruences representations of finite lattices, with emphasis on the more 'geometric' aspects." — Mathematical Reviews

Theoretical Aspects of Computing - ICTAC 2008
Theoretical Aspects of Computing - ICTAC 2008

Author: John S. Fitzgerald

Publisher: Springer

Published: 2008-08-25

Total Pages: 466

ISBN-13: 3540857621

DOWNLOAD EBOOK

Research on theoretical aspects of computing has a direct impact on the pr- tice of computer systems development. Over many decades, fundamental t- ories have emerged to describe functionality, temporal behavior and resource consumption. Theories of application domains are beginning to be exploited for modelling and analyzing intended computing systems before the expensive c- mitment is made to real programs and hardware. Recent years have seen major improvements in the cost-e?ectiveness of tools supporting the exploitation of theories through proof, model-checking and testing. Against this encouraging background, we are pleased to present papers that show something of the live- ness and diversity of research in theoretical aspects of computing today. ICTAC 2008, the 5th International Colloquium on Theoretical Aspects of Computing, was held on 1-3 September 2008 in Istanbul, Turkey, hosted by - banc? University. The ICTAC series was founded by the International Institute for SoftwareTechnologyof the United Nations University(UNU-IIST). It brings together practitioners and researchers from academia, industry and government to present results and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methodsandtoolsforsystemdevelopment. Theseriesalsopromotescooperation in research and education between participants and their institutions, from - veloping and industrial countries, in accordance with the mandate of the United Nations University. The previous ICTAC colloquia were held in Guiyang, China (2004, LNCS 3407), Hanoi, Vietnam (2005, LNCS 3722), Tunis, Tunisia (2006, LNCS 4281) and Macau SAR, China (2007, LNCS 4711).

Computer Algebra in Scientific Computing
Computer Algebra in Scientific Computing

Author: V.G. Ganzha

Publisher: Springer

Published: 2006-11-30

Total Pages: 323

ISBN-13: 3540451951

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 9th International Workshop on Computer Algebra in Scientific Computing, CASC 2006. The book presents 25 revised full papers together with 2 invited papers, covering various expanding applications of computer algebra to scientific computing, the computer algebra systems themselves, and the CA algorithms. Topics addressed are studies in Gröbner bases, polynomial algebra, homological algebra, quantifier elimination, celestial mechanics, and more.

Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science
Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science

Author: Janusz Czelakowski

Publisher: Springer

Published: 2018-03-20

Total Pages: 476

ISBN-13: 331974772X

DOWNLOAD EBOOK

This book celebrates the work of Don Pigozzi on the occasion of his 80th birthday. In addition to articles written by leading specialists and his disciples, it presents Pigozzi’s scientific output and discusses his impact on the development of science. The book both catalogues his works and offers an extensive profile of Pigozzi as a person, sketching the most important events, not only related to his scientific activity, but also from his personal life. It reflects Pigozzi's contribution to the rise and development of areas such as abstract algebraic logic (AAL), universal algebra and computer science, and introduces new scientific results. Some of the papers also present chronologically ordered facts relating to the development of the disciplines he contributed to, especially abstract algebraic logic. The book offers valuable source material for historians of science, especially those interested in history of mathematics and logic.