- Arts & Culture 6481
- Books in Foreign Languages 149
- Business & Economics 4476
- Computers 2198
- Dictionaries & Encyclopedias 635
- Education & Science 94097
- Abstracts 1162
- Astrology 12
- Astronomy 13
- Biology 34
- Chemistry 4129
- Coursework 4097
- Culture 28
- Diplomas 2383
- Drawings 1487
- Ecology 29
- Economy 337
- English 1173
- Entomology 2
- Ethics, Aesthetics 23
- For Education Students 24951
- Foreign Languages 115
- Geography 19
- Geology 17
- History 304
- Maps & Atlases 36
- Mathematics 14526
- Musical Literature 7
- Pedagogics 225
- Philosophy 185
- Physics 15878
- Political Science 126
- Practical Work 138
- Psychology 468
- Religion 45
- Russian and culture of speech 94
- School Textbooks 69
- Sexology 68
- Sociology 48
- Summaries, Cribs 674
- Tests 19832
- Textbooks for Colleges and Universities 531
- Theses 199
- To Help Graduate Students 23
- To Help the Entrant 114
- Vetting 423
- Works 58
- Информатика 15
- Engineering 3357
- Esoteric 951
- Fiction 3319
- For Children 382
- House, Family & Entertainment 2511
- Law 2775
- Medicine 1152
- Newspapers & Magazines 344
- Security 274
- Sport, Tourism 1001
- Website Promotion 654
Set theory and graph theory
Uploaded: 27.08.2016
Content: 14.12.14 ДМ.docx 106,42 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.