LARA

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
sav08:computational_complexity [2008/02/21 10:45]
vkuncak
sav08:computational_complexity [2008/02/21 11:09]
vkuncak
Line 9: Line 9:
   * Deterministic and non-deterministic complexity   * Deterministic and non-deterministic complexity
   * Undecidable and Enumerable (Semidecidable) problems   * Undecidable and Enumerable (Semidecidable) problems
 +
 +Classes of problems:
 +  P, NP, coNP, PSPACE, EXPTIME, NEXPTIME, elementary
 +
 +Ackerman'​s function
  
 ===== More Information ===== ===== More Information =====