Discrete Mathematics Research Progress
Seiten
2008
Nova Science Publishers Inc (Verlag)
978-1-60456-123-4 (ISBN)
Nova Science Publishers Inc (Verlag)
978-1-60456-123-4 (ISBN)
Discrete mathematics has become popular in recent decades because of its applications to computer science. In some mathematics curricula, finite mathematics courses cover discrete mathematical concepts for business, while discrete mathematics courses emphasise concepts for computer science majors.
Discrete mathematics, also called finite mathematics or Decision Maths, is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity. Most, if not all, of the objects studied in finite mathematics are countable sets, such as integers, finite graphs, and formal languages. Discrete mathematics has become popular in recent decades because of its applications to computer science. Concepts and notations from discrete mathematics are useful to study or describe objects or problems in computer algorithms and programming languages. In some mathematics curricula, finite mathematics courses cover discrete mathematical concepts for business, while discrete mathematics courses emphasise concepts for computer science majors.
Discrete mathematics, also called finite mathematics or Decision Maths, is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity. Most, if not all, of the objects studied in finite mathematics are countable sets, such as integers, finite graphs, and formal languages. Discrete mathematics has become popular in recent decades because of its applications to computer science. Concepts and notations from discrete mathematics are useful to study or describe objects or problems in computer algorithms and programming languages. In some mathematics curricula, finite mathematics courses cover discrete mathematical concepts for business, while discrete mathematics courses emphasise concepts for computer science majors.
Preface; Self-Concept and Self-Efficacy in Mathematics: Relation with Mathematics Motivation and Achievement; Some Topics in Galois Geometry (Symplectic Spreads Containing a Regulus); Algebraic Topics on Discrete Mathematics; Optimal Processes in Irreversible Microeconomics; K-Theory of Topological Algebras and Second Quantization; Hamiltonicity of 3 -- Connected L1 -- Graphs; Algorithms for Computing the Myerson Value by Dividends; Advanced Topics in Discrete Mathematics -- Hamiltionian Theory in Claw-Free Graphs; Finding Combinatorial Identities via Riordan Arrays; Structure of Certain Periodic Near Rings; Index.
| Erscheint lt. Verlag | 1.3.2008 |
|---|---|
| Zusatzinfo | Illustrations |
| Verlagsort | New York |
| Sprache | englisch |
| Maße | 260 x 180 mm |
| Gewicht | 710 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
| ISBN-10 | 1-60456-123-8 / 1604561238 |
| ISBN-13 | 978-1-60456-123-4 / 9781604561234 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
ein Übungsbuch für Fachhochschulen
Buch | Hardcover (2023)
Carl Hanser (Verlag)
CHF 23,75
