Polytime reductions of AF-algebraic problems
Computational Complexity
2021-04-30 v1 Functional Analysis
Operator Algebras
Abstract
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.
Cite
@article{arxiv.2104.14415,
title = {Polytime reductions of AF-algebraic problems},
author = {Daniele Mundici},
journal= {arXiv preprint arXiv:2104.14415},
year = {2021}
}