I have stumbled upon this idea of algebraic complexity and I couldn't really find what it is and how it is calculated. For instance: the algebraic complexity of Graham Scan (https://en.wikipedia.org/wiki/Graham_scan) is : second grade polynomials. Now, another question could sound something similar to this:Given a triangle ABC, with: A = (xA,yA), B = (xB,yB), C = (xC,yC).Let there be P = (xP,yP), Q = (xQ,yQ) other two distinct points in plane. What's the algebraic complexity for:[?]Deciding if PQ is parallel with AB, AC or BC.Any ideas?
How to calculate algebraic complexity?
complexity theory