Two polynomials f and g are said to be algebraically dependent over a field K if there exists a non-zero bivariate polynomial A with coefficients in K such that A(f,g) = 0. If no such polynomial exists, we say f and g are independent.
We consider the problem of finding an algorithm to test whether the given polynomials are algebraically independent. When the field has characteristic zero (eg: Rationals), this problem has a Randomised Polynomial (RP) time solution using the Jacobian Matrix of the given polynomials. The Jacobian matrix is full-rank iff the given polynomials are algebraically independent. However this criterion fails when the polynomials are taken over fields of positive characteristics. The current best known algorithm for the finite field case has the time complexity NP#P. The talk will cover the ideas we explored and discovered while studying the problem.