| dc.contributor.author | Kleitman, Daniel J. | en_US |
| dc.coverage.temporal | Fall 2002 | en_US |
| dc.date.issued | 2002-12 | |
| dc.identifier | 18.310-Fall2002 | |
| dc.identifier | local: 18.310 | |
| dc.identifier | local: IMSCP-MD5-33bf1f382319fe5656acc5c4338214a4 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/36375 | |
| dc.description.abstract | Principles of Applied Mathematics is a study of illustrative topics in discrete applied mathematics including sorting algorithms, information theory, coding theory, secret codes, generating functions, linear programming, game theory. There is an emphasis on topics that have direct application in the real world. | en_US |
| dc.language | en-US | en_US |
| dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en_US |
| dc.subject | sorting algorithms | en_US |
| dc.subject | information theory | en_US |
| dc.subject | coding theory | en_US |
| dc.subject | secret codes | en_US |
| dc.subject | generating functions | en_US |
| dc.subject | linear programming | en_US |
| dc.subject | game theory | en_US |
| dc.subject | discrete applied mathematics | en_US |
| dc.subject | mathematical analysis | en_US |
| dc.subject | sorting data | en_US |
| dc.subject | efficient data storage | en_US |
| dc.subject | efficient data transmission | en_US |
| dc.subject | error correction | en_US |
| dc.subject | secrecy | en_US |
| dc.subject | Fast Fourier Transform | en_US |
| dc.subject | network-flow problems | en_US |
| dc.subject | mathematical economics | en_US |
| dc.subject | statistics | en_US |
| dc.subject | probability theory | en_US |
| dc.subject | combinatorics | en_US |
| dc.subject | linear algebra | en_US |
| dc.title | 18.310 Principles of Applied Mathematics, Fall 2002 | en_US |
| dc.title.alternative | Principles of Applied Mathematics | en_US |
| dc.type | Learning Object | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
