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.
翻译:我们评估了AF-algebras(Murray-von Neumann)等值预测等同等级的若干决策问题的计算复杂性,AF-algebras的艾略特分类仪是按固定顺序排列的。我们设计了其中很多问题的合并时间削减。