- Arts & Culture 6391
- Books in Foreign Languages 148
- Business & Economics 4475
- Computers 2201
- Dictionaries & Encyclopedias 634
- Education & Science 97365
- Abstracts 1172
- Astrology 12
- Astronomy 13
- Biology 32
- Chemistry 5288
- Coursework 4139
- Culture 30
- Diplomas 2512
- Drawings 1480
- Ecology 29
- Economy 342
- English 1173
- Entomology 2
- Ethics, Aesthetics 23
- For Education Students 26059
- Foreign Languages 117
- Geography 19
- Geology 17
- History 313
- Maps & Atlases 36
- Mathematics 14523
- Musical Literature 7
- Pedagogics 232
- Philosophy 190
- Physics 15878
- Political Science 126
- Practical Work 135
- Psychology 468
- Religion 44
- Russian and culture of speech 101
- School Textbooks 69
- Sexology 68
- Sociology 48
- Summaries, Cribs 723
- Tests 20911
- Textbooks for Colleges and Universities 211
- Theses 188
- To Help Graduate Students 23
- To Help the Entrant 114
- Vetting 425
- Works 58
- Информатика 15
- Engineering 3356
- Esoteric 950
- Fiction 3298
- For Children 383
- House, Family & Entertainment 2506
- Law 2810
- Medicine 1155
- Newspapers & Magazines 344
- Security 274
- Sport, Tourism 1000
- Website Promotion 654
Set theory: Hasse diagram, relationships, circles Euler
Uploaded: 15.08.2016
Content: 22.01.16 ДМ.docx 90,39 kB
Product description
Detailed solution control work in discrete mathematics.
Discrete mathematics - part of mathematics that studies discrete mathematical structures, such as graphs and statements in logic. In the context of the whole of mathematics Discrete mathematics is often identified with a finite mathematics - the direction of studying the structure of finite - finite graphs, finite groups, finite state machines. It is possible to identify some of the features are not inherent in the divisions, working with endless and continuous structures. For example, in the discrete directions are usually wider class of solvable problems, since in many cases a complete listing possible options, while sections, dealing with endless and continuous structures, for the solubility usually requires substantial restrictions on the conditions. In the same context, especially in discrete mathematics are important task of building a specific algorithms, and including effective in terms of computational complexity. Another feature of discrete mathematics - the impossibility of applying it to the extreme problems of analysis techniques, essentially using discrete structures inaccessible to the smoothness of the concept. In a broad sense, discrete mathematics can be considered as covered large parts of algebra, number theory, mathematical logic.
As part of the curriculum discrete mathematics is usually regarded as a set of sections associated with applications to computer science and computer engineering: the theory of functional systems, graph theory, automata theory, coding theory, combinatorics, integer programming.