---
up:
  - "[[complexité algorithmique]]"
tags:
  - s/informatique/algorithmie
aliases:
---

> [!definition] $P$ (ou $PTIME$)
> $\displaystyle P = \bigcup _{c >0} \operatorname{DTIME}(n \mapsto n ^{c})$

> [!definition] $EXP$
> $\displaystyle EXP = \bigcup _{c >0} \operatorname{DTIME(n \mapsto 2^{n^{c}})}$

> [!definition] $LOGTIME$ (ou $L$)
> $LOGTIME = \operatorname{DTIME}(n \mapsto \log n)$