| Titre : |
Foundations in Discrete mathematics, Algorithms and Polynomial Approximations |
| Type de document : |
texte imprimé |
| Auteurs : |
Martina Kim, Auteur |
| Editeur : |
TSP Publishing |
| Année de publication : |
2026 |
| Importance : |
277 p. |
| Présentation : |
ill. couv. en Bleu |
| Format : |
25x17.5 cm |
| ISBN/ISSN/EAN : |
9789969124163 |
| Prix : |
27 500,00 DA |
| Note générale : |
Publisher : TSP Publishing (Algérie)
Publication date : 2026
Language : English
Print length : 270 pages
ISBN-10 : -
ISBN-13 : 978-99691-24163
Item weight : 808 g
Dimensions : 17 x 25 / 2.5 cm
|
| Langues : |
Anglais (eng) |
| Mots-clés : |
differential equations polynomails solving stochastic algorithms polyominoes |
| Index. décimale : |
515 |
| Résumé : |
Foundations in Discrete Mathematics, Algorithms and Polynomial Approximations
Today discrete mathematics has become a significant area of study in different domains. It provides excellent modelling tools for analyzing real-world phenomena that varies in one state or another and is a vital tool used in a wide range of applications, from comput ers to telephone call routing and from personnel assignments to genetics. Concepts and notations from discrete mathematics are useful in studying and describing objects and problems in all branches of computer science, such as computer algorithms, program ming languages, cryptography, automated theorem proving, and software development. Characteristically, discrete mathematics provides us problem solving solutions for only distinct and countable quantities which stands clearly in contrast to e.g. the mathemati cal analysis which encompasses continuous functions applied on uncountable and infini-tive quantities.
It presents an elementary and unified introduction to a compilation of topics that has not been available in a single source. It will provide significant research in many areas of discrete mathematics and combinatorics. The Big Data era poses a critically difficult challenge and striking development opportunities, how to efficiently turn massively large data into valuable information and meaningful knowledge. Discrete mathematics produces a significant collection of powerful methods, including mathematical tools for understanding and managing very high-dimensional data, inference systems for drawing sound conclusions from large and noisy data sets, and algorithms for scaling computa tions up to very large sizes. This book shows how to use mathematical models and meth-ods to analyze problems that arise in computer science. It will discuss the importance of discrete mathematics in computer science. Furthermore, it will attempt to provide an understanding of important related mathematical concepts and demonstrate with evidence based research why these concepts are essential in computer science. Proofs also play a growing role in computer science, they are used to certify that software and hardware will always behave correctly, something that no amount of testing can do. The book presents wide-range coverage of graph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theary, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Martina Kim received the MS degree in computational mathematics the PhD degree in computer & systems sciences. Her research interests include: combinatorial optimization, operations research, design and analysis of computer algorithms, algorithm complexity and computability, scheduling theory, grid optimization, network analysis, and risk analy and computability, schedulin sis. She has authored/coauthored several books and more than 50 papers in refereed Journals and chapters in books.
|
| Note de contenu : |
Citations
index |
Foundations in Discrete mathematics, Algorithms and Polynomial Approximations [texte imprimé] / Martina Kim, Auteur . - TSP Publishing, 2026 . - 277 p. : ill. couv. en Bleu ; 25x17.5 cm. ISBN : 9789969124163 : 27 500,00 DA Publisher : TSP Publishing (Algérie)
Publication date : 2026
Language : English
Print length : 270 pages
ISBN-10 : -
ISBN-13 : 978-99691-24163
Item weight : 808 g
Dimensions : 17 x 25 / 2.5 cm
Langues : Anglais ( eng)
| Mots-clés : |
differential equations polynomails solving stochastic algorithms polyominoes |
| Index. décimale : |
515 |
| Résumé : |
Foundations in Discrete Mathematics, Algorithms and Polynomial Approximations
Today discrete mathematics has become a significant area of study in different domains. It provides excellent modelling tools for analyzing real-world phenomena that varies in one state or another and is a vital tool used in a wide range of applications, from comput ers to telephone call routing and from personnel assignments to genetics. Concepts and notations from discrete mathematics are useful in studying and describing objects and problems in all branches of computer science, such as computer algorithms, program ming languages, cryptography, automated theorem proving, and software development. Characteristically, discrete mathematics provides us problem solving solutions for only distinct and countable quantities which stands clearly in contrast to e.g. the mathemati cal analysis which encompasses continuous functions applied on uncountable and infini-tive quantities.
It presents an elementary and unified introduction to a compilation of topics that has not been available in a single source. It will provide significant research in many areas of discrete mathematics and combinatorics. The Big Data era poses a critically difficult challenge and striking development opportunities, how to efficiently turn massively large data into valuable information and meaningful knowledge. Discrete mathematics produces a significant collection of powerful methods, including mathematical tools for understanding and managing very high-dimensional data, inference systems for drawing sound conclusions from large and noisy data sets, and algorithms for scaling computa tions up to very large sizes. This book shows how to use mathematical models and meth-ods to analyze problems that arise in computer science. It will discuss the importance of discrete mathematics in computer science. Furthermore, it will attempt to provide an understanding of important related mathematical concepts and demonstrate with evidence based research why these concepts are essential in computer science. Proofs also play a growing role in computer science, they are used to certify that software and hardware will always behave correctly, something that no amount of testing can do. The book presents wide-range coverage of graph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theary, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Martina Kim received the MS degree in computational mathematics the PhD degree in computer & systems sciences. Her research interests include: combinatorial optimization, operations research, design and analysis of computer algorithms, algorithm complexity and computability, scheduling theory, grid optimization, network analysis, and risk analy and computability, schedulin sis. She has authored/coauthored several books and more than 50 papers in refereed Journals and chapters in books.
|
| Note de contenu : |
Citations
index |
|  |
Affiner la recherche Interroger des sources externes
