1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Detalles del recurso

Descripción

This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds: Fundamental concepts of Mathematics: definitions, proofs, sets, functions, relations. Discrete structures: modular arithmetic, graphs, state machines, counting. Discrete probability theory. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science). Contributors Srinivas Devadas Lars Engebretsen David Karger Eric Lehman Thomson Leighton Charles Leiserson Nancy Lynch Santosh Vempala

Pertenece a

DSpace at MIT  

Autor(es)

Nagpal, Radhika -  Meyer, Albert R. - 

Id.: 55230941

Idioma: en-US  - 

Versión: 1.0

Estado: Final

Palabras clavediscrete mathematics - 

Cobertura:  Fall 2002 - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Usage Restrictions: This site (c) Massachusetts Institute of Technology 2012. 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") unless otherwise noted. 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.

Requerimientos técnicos:  Browser: Any - 

Fecha de contribución: 30-abr-2017

Contacto:

Localización:
* 6.042J-Fall2002
* local: 6.042J
* local: 18.062J
* local: IMSCP-MD5-59b9039bdcbbcc7146535fa3512b7f0c

Otros recursos del mismo autor(es)

  1. Collective transport of complex objects by simple robots: Theory and experiments Ants show an incredible ability to collectively transport complex irregular-shaped objects with seem...
  2. Materials and mechanisms for amorphous robotic construction We present and compare three different amorphous materials for robotic construction. By conforming t...
  3. A Self-Adaptive Framework for Modular Robots in Dynamic Environment: Theory and Applications Biological systems achieve amazing adaptive behavior with local agents that perform simple sensing a...
  4. Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems Adaptive collective systems are common in biology and beyond. Typically, such systems require a task...
  5. Task Allocation in Ant Colonies In this paper we propose a mathematical model for studying the phenomenon of division of labor in an...

Otros recursos de la mismacolección

  1. 18.905 Algebraic Topology, Fall 2006 This course is a first course in algebraic topology. The emphasis is on homology and cohomology theo...
  2. 18.785 Number Theory I, Fall 2016 This is the first semester of a one year graduate course in number theory covering standard topics i...
  3. 2.062J / 1.138J / 18.376J Wave Propagation, Fall 2006 This course discusses the Linearized theory of wave phenomena in applied mechanics. Examples are cho...
  4. 18.783 Elliptic Curves, Spring 2015 This graduate-level course is a computationally focused introduction to elliptic curves, with applic...
  5. 18.785 Number Theory I, Fall 2015 This is the first semester of a one year graduate course in number theory covering standard topics i...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.