Polytime reductions of AF-algebraic problems

04/28/2021

∙

by   Daniele Mundici, et al.

∙

0

∙

share

We assess the computational complexity of several decision problems concerning (Murray-von Neumann) equivalence classes of projections of AF-algebras whose Elliott classifier is lattice-ordered. We construct polytime reductions among many of these problems.