4 citations · 11 across the 11 of their papers we have counts for
1 paper · 2 filters
Salman Parsa
We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) 2-complexes. We show, as an extension of an earlier…