Polytime reductions of AF-algebraic problems

Autor:	Mundici, Daniele
Rok vydání:	2021
Předmět:	Computer Science - Computational Complexity Mathematics - Functional Analysis Mathematics - Operator Algebras 46L35
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2104.14415 Zobrazit plný text záznamu View this record from Arxiv