This paper studies algorithmic Helly-type problems in the framework of
the algorithmic theory of convex bodies developed by Grotschel, Lovas
z, and Schrijver. Various oracle-polynomial-time algorithms are presen
ted that are complemented by NP-hardness results for polytopes. In add
ition, some new Helly-type theorems are derived.