Computational algebraic geometry applies algorithmic techniques to problems in algebraic geometry, focusing on the effective manipulation of polynomial ideals and the algebraic varieties they define.