Polytime reductions of AF-algebraic problems
Daniele Mundici
TL;DR
This paper investigates the computational complexity of decision problems related to AF-algebras, providing polynomial-time reductions among various problems to better understand their computational relationships.
Contribution
It introduces polynomial-time reductions among decision problems in AF-algebras with lattice-ordered Elliott classifiers, advancing the understanding of their computational complexity.
Findings
Established polytime reductions among AF-algebra decision problems
Enhanced understanding of the computational complexity landscape for AF-algebras
Identified relationships between equivalence classes of projections
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · semigroups and automata theory · Rough Sets and Fuzzy Logic