A fundamental theorem of Nash-Williams from 1961 states that a graph has a k-arc-connected orientation if and only if it is 2k-edge-connected. Since then, numerous possibilities of extending this theorem have been considered. Among others, possibilities to impose extra conditions on the orientation in Nash-Williams' theorem and a stronger, more local form of Nash-Williams' theorem will be discussed. I will describe recent developments, mainly negative complexity results. If time allows, I will show one of the reductions.