Skip to content

feat(complexity,#17063): tranche T2 -- base 05 Compter est plus dur que verifier (#P, determinant contre permanente) #18819

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
myia-ai-01 merged 1 commit into from
Oct 3, 2026
Merged

feat(complexity,#17063): tranche T2 -- base 05 Compter est plus dur que verifier (#P, determinant contre permanente) #18819

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion MyIA.AI.Notebooks/Complexity/Complexity-04b-OnlineConjectures-Secretary-KServer.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@
},
"source": [
"# Complexity-04b — La semaine historique de l'algorithmique online : secrétaire matroïdal et k-server\n",
"\n**Navigation** : [Index](README.md) | [04 — Décider sans connaître la suite](Complexity-04-OnlineAlgorithms-Python.ipynb) | [05b — La permanente, frontière quantique →](Complexity-05b-AaronsonArkhipov-PermanenteBosonSampling.ipynb)\n",
"\n**Navigation** : [Index](README.md) | [04 — Décider sans connaître la suite](Complexity-04-OnlineAlgorithms-Python.ipynb) | [05 — Compter est plus dur que vérifier →](Complexity-05-CountingHarder-Permanent.ipynb)\n",
"\n",
"**Approfondissement de [04 — Décider sans connaître la suite](Complexity-04-OnlineAlgorithms-Python.ipynb)** | [Index de la série](README.md)\n",
"\n",
Expand Down
Loading
Loading