Le lezio\u00adni del 2020\/21 sono regi\u00adstra\u00adte in stu\u00addio, a cau\u00adsa dell\u2019emergenza Covid. Si \u00e8 cer\u00adca\u00adto di pre\u00adsta\u00adre atten\u00adzio\u00adne agli aspet\u00adti audio\/video, ma si sen\u00adte la man\u00adcan\u00adza di un \u201cpub\u00adbli\u00adco\u201d.<\/p>\n
Le lezio\u00adni sono ospi\u00adta\u00adte in que\u00adsto cana\u00adle Youtube<\/a>. Ci sono anche lezio\u00adni pre\u00adce\u00adden\u00adti, regi\u00adstra\u00adte in aula, un po\u2019 pi\u00f9 autentiche.<\/p>\n Legenda:<\/p>\n Le lezio\u00adni del 2020\/21 sono regi\u00adstra\u00adte in stu\u00addio, a cau\u00adsa dell\u2019emergenza Covid. Si \u00e8 cer\u00adca\u00adto di pre\u00adsta\u00adre atten\u00adzio\u00adne agli aspet\u00adti audio\/video, ma si sen\u00adte la man\u00adcan\u00adza di un \u201cpub\u00adbli\u00adco\u201d. Le lezio\u00adni sono ospi\u00adta\u00adte in que\u00adsto cana\u00adle Youtube. Ci sono anche lezio\u00adni pre\u00adce\u00adden\u00adti, regi\u00adstra\u00adte in aula, un po\u2019 pi\u00f9 auten\u00adti\u00adche. Legenda: [1] signi\u00adfi\u00adca che adot\u00adto la [\u2026]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":74,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"wp_typography_post_enhancements_disabled":false,"footnotes":""},"class_list":["post-112","page","type-page","status-publish","hentry","post"],"_links":{"self":[{"href":"http:\/\/cricca.disi.unitn.it\/montresor\/wp-json\/wp\/v2\/pages\/112","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/cricca.disi.unitn.it\/montresor\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/cricca.disi.unitn.it\/montresor\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/cricca.disi.unitn.it\/montresor\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/cricca.disi.unitn.it\/montresor\/wp-json\/wp\/v2\/comments?post=112"}],"version-history":[{"count":190,"href":"http:\/\/cricca.disi.unitn.it\/montresor\/wp-json\/wp\/v2\/pages\/112\/revisions"}],"predecessor-version":[{"id":5602,"href":"http:\/\/cricca.disi.unitn.it\/montresor\/wp-json\/wp\/v2\/pages\/112\/revisions\/5602"}],"up":[{"embeddable":true,"href":"http:\/\/cricca.disi.unitn.it\/montresor\/wp-json\/wp\/v2\/pages\/74"}],"wp:attachment":[{"href":"http:\/\/cricca.disi.unitn.it\/montresor\/wp-json\/wp\/v2\/media?parent=112"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}\n
Lezioni 2020\/21<\/h4>\n
\n\n
\n Lezione<\/strong><\/td>\n Youtube<\/strong><\/td>\n Download<\/strong><\/td>\n Status<\/strong><\/td>\n<\/tr>\n \n 01 \u2014 Introduzione \u2014 Problemi e algoritmi<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 01 \u2014 Introduzione \u2014 Valutazione algoritmi<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi \u2014 Modelli di calcolo<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi \u2014 Notazione asintotica<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi \u2014 Complessit\u00e0 algo\u00adrit\u00admi vs problemi<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi \u2014 Tipologia input \u2014 Selection Sort<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi \u2014 Tipologia input \u2014 Insertion Sort<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi \u2014 Tipologia input \u2014 Merge Sort<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Propriet\u00e0 nota\u00adzio\u00adne asintotica<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Analisi per livelli<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Sostituzione \u2014 1<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Sostituzione \u2014 2<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Sostituzione \u2014 3<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Sostituzione \u2014 4<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Sostituzione \u2014 5<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Master Theorem \u2014 Versione base<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Master Theorem \u2014 Versione estesa<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Ricorrenze ordi\u00adne costante<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Esercizio<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Funzioni \u2014 Back to algorithms<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 03\u201304 \u2014 Strutture di dati<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 05 \u2014 Alberi \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 05 \u2014 Alberi \u2014 Alberi binari<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 05 \u2014 Alberi \u2014 Alberi generici<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 06 \u2014 ABR<\/span> \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 06 \u2014 ABR<\/span> \u2014 Inserimento<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 06 \u2014 ABR<\/span> \u2014 Cancellazione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 06 \u2014 Alberi Red-Black \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 06 \u2014 Alberi Red-Black \u2014 Inserimento<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 06 \u2014 Alberi Red-Black \u2014 Dimostrazione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 06 \u2014 Alberi Red-Black \u2014 Cancellazione (cen\u00adni)<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 Specifica e memorizzazione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 BFS<\/span><\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 DFS<\/span><\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 Componenti connesse<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 Cicli in gra\u00adfi non orientati<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 Schema DFS<\/span><\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 Cicli in gra\u00adfi orientati<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 Ordinamento topologico<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 07 \u2014 Hashing \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 07 \u2014 Hashing \u2014 Funzioni hash<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 07 \u2014 Hashing \u2014 Liste di trabocco<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 07 \u2014 Hashing \u2014 Indirizzamento Aperto<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 07 \u2014 Hashing \u2014 Implementazione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 07 \u2014 Hashing \u2014 Conclusioni<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 09 \u2014 Grafi \u2014 Componenti for\u00adte\u00admen\u00adte connesse<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi Ammortizzata \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi Ammortizzata \u2014 Metodo aggregazione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi Ammortizzata \u2014 Metodo accantonamenti<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi Ammortizzata \u2014 Metodo potenziale<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi Ammortizzata \u2014 Vettori dina\u00admi\u00adci \u2014 Espansione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 02 \u2014 Analisi Ammortizzata \u2014 Vettori dina\u00admi\u00adci \u2014 Contrazione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 08 \u2014 Insiemi e dizionari<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 12 \u2014 Divide&<\/span>Impera \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 12 \u2014 Divide&<\/span>Impera \u2014 Hanoi<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 12 \u2014 Divide&<\/span>Impera \u2014 Quicksort \u2014 Algoritmo<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 12 \u2014 Divide&<\/span>Impera \u2014 Quicksort \u2014 Complessit\u00e0<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 12 \u2014 Divide&<\/span>Impera \u2014 Strassen<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 12 \u2014 Divide&<\/span>Impera \u2014 Esercizio<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 10 \u2014 Strutture dati spe\u00adcia\u00adli \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 10 \u2014 Strutture dati spe\u00adcia\u00adli \u2014 Heap<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 10 \u2014 Strutture dati spe\u00adcia\u00adli \u2014 HeapSort \u2014 maxHeapRestore<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 10 \u2014 Strutture dati spe\u00adcia\u00adli \u2014 HeapSort \u2014 heapBuild<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 10 \u2014 Strutture dati spe\u00adcia\u00adli \u2014 HeapSort \u2014 Algoritmo<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 10 \u2014 Strutture dati spe\u00adcia\u00adli \u2014 Min Priority Queue<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione dina\u00admi\u00adca \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione dina\u00admi\u00adca \u2014 Domino<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione dina\u00admi\u00adca \u2014 Hateville<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione dina\u00admi\u00adca \u2014 Zaino<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione dina\u00admi\u00adca \u2014 Zaino con Memoization<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione dina\u00admi\u00adca \u2014 Zaino sen\u00adza limiti<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione dina\u00admi\u00adca \u2014 LCS<\/span><\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione Dinamica \u2014 String Matching<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione Dinamica \u2014 Catena matrici<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 13 \u2014 Programmazione Dinamica \u2014 Intervalli pesati<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 11 \u2014 Scelta del\u00adla strut\u00adtu\u00adra dati \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 11 \u2014 Scelta del\u00adla strut\u00adtu\u00adra dati \u2014 Teorema di Bellman<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 11 \u2014 Scelta del\u00adla strut\u00adtu\u00adra dati \u2014 Algoritmo prototipo<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 11 \u2014 Scelta del\u00adla strut\u00adtu\u00adra dati \u2014 Algoritmo di Dijkstra<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 11 \u2014 Scelta del\u00adla strut\u00adtu\u00adra dati \u2014 Complessit\u00e0 Dijkstra e varianti<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 11 \u2014 Scelta del\u00adla strut\u00adtu\u00adra dati \u2014 Bellman-Ford<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 11 \u2014 Scelta del\u00adla strut\u00adtu\u00adra dati \u2014 Dag<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 11 \u2014 Scelta del\u00adla strut\u00adtu\u00adra dati \u2014 Conclusioni<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 11 \u2014 Scelta del\u00adla strut\u00adtu\u00adra dati \u2014 Floyd-Warshall<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Intervalli Indipendenti<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Resto<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Scheduling<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Zaino Frazionario<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Huffman<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 10 \u2014 Strutture dati spe\u00adcia\u00adli \u2014 MFSet \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 10 \u2014 Strutture dati spe\u00adcia\u00adli \u2014 MFSet \u2014 Euristiche<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Alberi di coper\u00adtu\u00adra mini\u00admi \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Alberi di coper\u00adtu\u00adra mini\u00admi \u2014 Algoritmo generico<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Alberi di coper\u00adtu\u00adra mini\u00admi \u2014 Kruskal<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 14 \u2014 Greedy \u2014 Alberi di coper\u00adtu\u00adra mini\u00admi \u2014 Prim<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 15 \u2014 Ricerca loca\u00adle \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 15 \u2014 Ricerca loca\u00adle \u2014 Reti di flusso<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 15 \u2014 Ricerca loca\u00adle \u2014 Ford-Fulkerson \u2014 Schema generale<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 15 \u2014 Ricerca loca\u00adle \u2014 Ford-Fulkerson \u2014 Correttezza<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 15 \u2014 Ricerca loca\u00adle \u2014 Ford-Fulkerson \u2014 Cammini aumentanti<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 15 \u2014 Ricerca loca\u00adle \u2011Ford-Fulkerson \u2014 Versione Java<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 15 \u2014 Ricerca loca\u00adle \u2014 Complessit\u00e0 algo\u00adrit\u00admi di flusso<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 15 \u2014 Ricerca loca\u00adle \u2014 Ottimalit\u00e0<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 15 \u2014 Ricerca loca\u00adle \u2014 Abbinamento gra\u00adfi bipartiti<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 16 \u2014 Backtracking \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 16 \u2014 Backtracking \u2014 Schema generale<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 16 \u2014 Backtracking \u2014 Sottoinsiemi<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 16 \u2014 Backtracking \u2014 Permutazioni<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 16 \u2014 Backtracking \u2014 Sottoinsiemi di dimen\u00adsio\u00adne k<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 16 \u2014 Backtracking \u2014 Subset sum<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 16 \u2014 Backtracking \u2014 Problema del\u00adle n regine<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 16 \u2014 Backtracking \u2014 Giochi<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 18 \u2014 NP<\/span> Completezza \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 18 \u2014 NP<\/span> Completezza \u2014 Riduzioni<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 18 \u2014 NP<\/span> Completezza \u2014 Definizione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 19 \u2014 Problemi intrat\u00adta\u00adbi\u00adli \u2014 Introduzione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 19 \u2014 Problemi intrat\u00adta\u00adbi\u00adli \u2014 Algoritmi pseudo-polinomiali<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 19 \u2014 Problemi intrat\u00adta\u00adbi\u00adli \u2014 Algoritmi di approssimazione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 19 \u2014 Problemi intrat\u00adta\u00adbi\u00adli \u2014 Euristiche<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 19 \u2014 Problemi intrat\u00adta\u00adbi\u00adli \u2014 Branch&<\/span>Bound<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 16 \u2014 Backtracking \u2014 Inviluppo Convesso<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 17 \u2014 Algoritmi pro\u00adba\u00adbi\u00adli\u00adsti\u00adci \u2014 Primalit\u00e0<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 17 \u2014 Algoritmi pro\u00adba\u00adbi\u00adli\u00adsti\u00adci \u2014 Bloom Filter<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n 17 \u2014 Algoritmi pro\u00adba\u00adbi\u00adli\u00adsti\u00adci \u2014 Selezione<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n \n Algoritmi di ordinamento<\/td>\n [Youtube<\/a>]<\/td>\n [Download<\/a>]<\/td>\n [1]<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"