1 paper · 1 filter
Arturo Jaime, Rufus Willett
Complexity rank for C∗-algebras was introduced by the second author and Yu for applications towards the UCT: very roughly, this rank is at most n if you can repeatedly cut the…