7 citations · 13 across the 4 of their papers we have counts for
Showing math.GTShow all
2 papers · 1 filter
math.GT2014
2-manifold recognition is in logspace
Benjamin A. Burton, Murray Elder, Arkadius Kalka +1
We prove that the homeomorphism problem for 2-manifolds can be decided in logspace. The proof relies on Reingold's logspace solution to the undirected -connectivity problem in…
math.GT2010★ 7 cited
Maximal admissible faces and asymptotic bounds for the normal surface solution space
Benjamin A. Burton
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dim…