We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.
On topological complexity of twisted products
The Topological Complexity of a Surface
On topological complexity of hyperbolic groups
![QR code for arXiv:math/0701445 [math.GT]](http://oss.arxitics.com/images/favicon.svg)