Showing papers by "Terrance E. Boult published in 1986"

TL;DR: Lower and upper bounds are found on the complexity of computing the topological degree of functions defined on the n-dimensional unit cube Cn, f: Cn → Rn, n ≥ 2, which satisfy a Lipschitz condition with constant K.