Venerdì 5 novembre 2021 alle ore 15:00,
Fernando L. Pelayo (Castilla-La Mancha University - Department of Computer Science)

Titolo: Quantum invariants for graph isomorphism

Abstract: Since McKay presented his Nauty algorithm in 1981 to characterize
graph isomorphism until the last proposal by Babai in 2015, a huge
effort has been devoted to the graph isomorphism problem together with
an improvement on their complexities. This problem is assumed to
belong to neither P nor NP-Complete Computational Complexity classes.
Maybe the most efficient deterministic algorithm on practice currently
available is Traces algorithm proposed by McKay & Piperno in 2014.
Quantum computing is facing this problem in an almost disruptive and
very interesting perspective...

Presso il Dipartimento di Matematica e Fisica in
Largo San Leonardo Murialdo 1 - Edificio C - Aula 311

https://bit.ly/3nQG8jM

L’annuncio è presente sul sito web dell’ateneo:
https://www.uniroma3.it/articoli/quantum-invariants-for-graph-isomorphism-182302/