2000 character limit reached
Polytime reductions of AF-algebraic problems
Published 28 Apr 2021 in cs.CC, math.FA, and math.OA | (2104.14415v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
