We study exact active learning of binary and multiclass classifiers with margin. Given an n-point set X ⊂ℝ^m, we want to learn any unknown classifier on X whose classes have finite strong convex hull margin, a new notion extending the SVM margin.In the standard active learning setting, where only label queries are allowed, learning a classifier with strong convex hull margin γ requires in the worst case Ω(1+1/γ)^m-1/2 queries. On the other hand, using the more powerful seed queries (a variant of equivalence queries), the target classifier could be learned in O(m log n) queries via Littlestone's Halving algorithm; however, Halving is computationally inefficient.In this work we show that, by carefully combining the two types of queries, a binary classifier can be learned in time poly(n+m) using only O(m^2 log n) label queries and O(m logm/γ) seed queries; the result extends to k-class classifiers at the price of a k!k^2 multiplicative overhead. Similar results hold when the input points have bounded bit complexity, or when only one class has strong convex hull margin against the rest. We complement these upper bounds by showing that in the worst case any algorithm needs Ω(k m log1/γ/log m) seed and label queries to learn a k-class classifier with strong convex hull margin γ.