Computational complexity is conjectured to be inherent to a large class of basic problems, which instead we should be capable of solving, since they are of paramount practical importance...
Quando: Giovedì 21 febbraio 2019, ore 18.30
Dove: Sala Conferenze, ex Ospedale Militare
… About such “unsolvable problems” we know a lot of things – we can even solve them, if need be, e.g. exhibiting solutions which are probably correct, the error probability being so low that one cannot take it seriously. Actually, we can even take advantage of our computational weakness, for example when we have to protect the privacy and the authenticity of our communications in the web.
Leggi l’abstract completo, anche in italiano: Abstract_SGARRO_Complessità di calcolo_febbraio 2019
Guarda la locandina dell’evento: Locandina complessita calcolo_SGARRO_ 21.02.2019Corsi e Conferenze