oskar/cours
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

eduroam-prg-hf-1-7-38.net.univ-paris-diderot.fr 2025-10-8:16:59:19

Browse Source
This commit is contained in:
oskar
2025-10-08 16:59:19 +02:00
parent bace5a1153
commit 2bd42acce8
2 changed files with 15 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
classes de complexité.md
View File

@@ -5,6 +5,8 @@ tags:
- s/informatique/algorithmie - s/informatique/algorithmie
aliases: aliases:
--- ---
![[langage décidable en temps déterministe]]
# Complexité temporelle
> [!definition] $P$ (ou $PTIME$) > [!definition] $P$ (ou $PTIME$)
> $\displaystyle P = \bigcup _{c >0} \operatorname{DTIME}(n \mapsto n ^{c})$ > $\displaystyle P = \bigcup _{c >0} \operatorname{DTIME}(n \mapsto n ^{c})$
@@ -15,3 +17,6 @@ aliases:
> [!definition] $LOGTIME$ (ou $L$) > [!definition] $LOGTIME$ (ou $L$)
> $LOGTIME = \operatorname{DTIME}(n \mapsto \log n)$ > $LOGTIME = \operatorname{DTIME}(n \mapsto \log n)$
# Complexité spatiale

10
lien entre complexité temporelle et complexité spatiale.md Normal file
View File

@@ -0,0 +1,10 @@
---
up:
- "[[complexité algorithmique]]"
tags:
- s/informatique/algorithmie
aliases:
---
> [!proposition]+
> $\forall f \in \mathbb{N}^{\mathbb{N}},\quad \operatorname{DTIME}(f) \subseteq \operatorname{DSPACE}(f)$