From TheBestLinks.com
(Redirected from
Discretization)
Discrete mathematics, sometimes called finite mathematics, 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 the integers.
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 express 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 emphasize concepts for computer science majors.
See also the list of basic discrete mathematics topics.
For contrast, see continuum, topology, and mathematical analysis.
Discrete mathematics usually includes :
Some applications: game theory — queuing theory — graph theory — combinatorial geometry and combinatorial topology — linear programming — cryptography (including cryptology and cryptanalysis) — theory of computation
See also
Reference and further reading
- Donald E. Knuth, The Art of Computer Programming
- Kenneth H. Rosen, Discrete Mathematics and Its Applications
- Richard Johnsonbaugh, Discrete Mathematics 5th ed. Macmillan, New Jersey
de:Diskrete Mathematik
es:Matem醫ica discreta
he:מתמטיקה דיסקרטית
nl:Discrete wiskunde
ja:離散数学
pl:Matematyka dyskretna
sk:Diskr閠na matematika
zh:离散数学
Related links
Top visited
0 of
0 links
[no links posted yet]
>> place link >>
Discussion
Last posted
0 of
0 messages
[no messages posted yet]
>> post message >>
Watch
You can
add this article to your own "watchlist" and receive e-mail notification about all changes in this page.