discrete mathematics


Also found in: Acronyms, Wikipedia.

discrete mathematics

[di‚skrēt ‚math·ə′mat·iks]
(mathematics)
References in periodicals archive ?
Discrete mathematics has become increasingly popular in recent years due to its growing applications in the field of computer science.
It is suitable for an upper-level undergraduate course of one or two semesters on combinatorics, graph theory, or discrete mathematics.
The programs from Glencoe/McGraw-Hill listed by the district are: -- Glencoe California Mathematics: Concepts, Skills & Problem Solving (for Grades 6-7 Basic Mathematics) -- California Algebra Readiness: Concepts, Skills & Problem Solving -- Glencoe California Algebra 1: Concepts, Skills & Problem Solving -- Discrete Mathematics and Its Applications -- California Geometry: Concepts and Applications
Contributors in biology, in mathematics, and in bioinformatics introduce undergraduate students and their instructors to more applications of discrete mathematics to biology than can be found in standard textbooks.
Oriented towards advanced students and researchers in the fields of both artificial intelligence and the study of algorithms as well as discrete mathematics.
This text for advanced undergraduates and graduate students in mathematics and computer science assumes no prior knowledge of molecular biology beyond the high school level; however, students should have prior college-level courses in discrete mathematics and algorithms.
Pre-Transition Mathematics -- new course available 2008 -- Geometry -- third edition available 2008 -- Advanced Algebra -- third edition available 2008 -- Functions, Statistics, and Trigonometry -- third edition available 2009 -- Precalculus and Discrete Mathematics -- third edition available 2009
Helmut Pottmann is a professor of geometry at Vienna University of Technology, where he directs the research group Geometric Modeling and Industrial Geometry at the Institute of Discrete Mathematics and Geometry.
Students are assumed to have some discrete mathematics background, including a knowledge of algorithms, computational complexity, and binary arithmetic.
Originally published as Discrete Mathematics for New Technology, the new edition features a new, more descriptive title.
This handbook provides an opportunity for researchers, graduate students and practitioners to explore the application of algorithms and discrete mathematics for solving scientific, engineering and practical problems.
introduces the theoretical and practical foundations of intelligent systems and the technology it uses, for students who are at least a little familiar with discrete mathematics and modern programming languages such as C.

Full browser ?