Now showing items 1-5 of 5

    • 18.310 Principles of Applied Mathematics, Fall 2002 

      Kleitman, Daniel J. (2002-12)
      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, ...
    • 18.310 Principles of Applied Mathematics, Fall 2004 

      Kleitman, Daniel J. (2004-12)
      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, ...
    • 18.310C Principles of Applied Mathematics, Fall 2007 

      Shor, Peter; Kleitman, Daniel (2007-12)
      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, ...
    • 18.314 Combinatorial Analysis, Fall 2005 

      Postnikov, Alexander (2005-12)
      This course analyzes combinatorial problems and methods for their solution. Prior experience with abstraction and proofs is helpful. Topics include: Enumeration, generating functions, recurrence relations, construction of ...
    • 6.042J / 18.062J Mathematics for Computer Science, Spring 2005 

      Leiserson, Charles; Lehman, Eric; Devadas, Srinivas; Meyer, Albert R. (2005-06)
      This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets ...