Lab for Automated Reasoning and Analysis LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

sav08:computational_complexity [2008/02/21 21:10]
piskac
sav08:computational_complexity [2010/02/22 01:13] (current)
vkuncak
Line 17: Line 17:
 ===== More Information ===== ===== More Information =====
  
 +  * [[http://​infowww.epfl.ch/​imoniteur_ISAP/​!itffichecours.htm?​ww_i_matiere=238861988&​ww_x_anneeAcad=2009-2010&​ww_i_section=2139068&​ww_c_langue=en|Theory of Computation Course]]
   * [[Calculus of Computation Textbook]], Section 2.6 (Decidability and Complexity)   * [[Calculus of Computation Textbook]], Section 2.6 (Decidability and Complexity)
   * [[:Gallier Logic Book]], Section 3.3.5   * [[:Gallier Logic Book]], Section 3.3.5
   * [[Theory of Computation Courses and Books]]   * [[Theory of Computation Courses and Books]]
   * [[http://​www.cs.princeton.edu/​theory/​complexity/​|Complexity Theory: A Modern Approach]], Chapter on [[http://​www.cs.princeton.edu/​theory/​complexity/​NPchap.pdf|NP and NP completeness]]   * [[http://​www.cs.princeton.edu/​theory/​complexity/​|Complexity Theory: A Modern Approach]], Chapter on [[http://​www.cs.princeton.edu/​theory/​complexity/​NPchap.pdf|NP and NP completeness]]
 
sav08/computational_complexity.txt · Last modified: 2010/02/22 01:13 by vkuncak
 
© EPFL 2018 - Legal notice