From b70ec933e6f01cfe628e6fca24e24e2433a89f68 Mon Sep 17 00:00:00 2001 From: Marco Marrelli <76500649+volpoh@users.noreply.github.com> Date: Fri, 20 May 2022 13:27:09 +0200 Subject: [PATCH] Update README-it.md --- translations/README-it.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/translations/README-it.md b/translations/README-it.md index 0e1f57e..734145b 100644 --- a/translations/README-it.md +++ b/translations/README-it.md @@ -1050,10 +1050,10 @@ I grafi possono essere usati per rappresentare molti problemi in informatica, pe - [ ] [Make School: Probability (Video in Inglese)](https://www.youtube.com/watch?v=sZkAAk9Wwa4) - [ ] [Make School: More Probability and Markov Chains (Video in Inglese)](https://www.youtube.com/watch?v=dNaJg-mLobQ) - [ ] Khan Academy: - - Course layout: - - [ ] [Basic Theoretical Probability](https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic) + - Corso: + - [ ] [Teoria della Probabilità Basica](https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic) - Just the video - 41 (each are simple and each are short): - - [ ] [Probability Explained (Video in Inglese)](https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19) + - [ ] [Spiegazione della Probabilità (Video in Inglese)](https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19) - ### NP, NP-Completo e Algoritmi di Approssimazione - Know about the most famous classes of NP-complete problems, such as traveling salesman and the knapsack problem,