  We prove that intersection multiplicity of two plane curves defined by
Fulton's axioms is equivalent to the multiplicity computed using blowup. The
algorithm based on the latter is presented and its complexity is estimated. We
compute for polynomials over $\Q$ and its algebraic extensions.
