<s>
In	O
mathematics	O
,	O
polynomial	B-Algorithm
identity	I-Algorithm
testing	I-Algorithm
(	O
PIT	O
)	O
is	O
the	O
problem	O
of	O
efficiently	O
determining	O
whether	O
two	O
multivariate	O
polynomials	O
are	O
identical	O
.	O
</s>
<s>
Determining	O
the	O
computational	O
complexity	O
required	O
for	O
polynomial	B-Algorithm
identity	I-Algorithm
testing	I-Algorithm
is	O
one	O
of	O
the	O
most	O
important	O
open	O
problems	O
in	O
algebraic	O
computing	O
complexity	O
.	O
</s>
<s>
As	O
with	O
any	O
polynomial	B-Algorithm
identity	I-Algorithm
testing	I-Algorithm
question	O
,	O
it	O
can	O
be	O
trivially	O
transformed	O
into	O
the	O
question	O
"	O
Is	O
a	O
certain	O
polynomial	O
equal	O
to	O
0	O
?	O
</s>
<s>
Determining	O
the	O
computational	O
complexity	O
required	O
for	O
polynomial	B-Algorithm
identity	I-Algorithm
testing	I-Algorithm
is	O
one	O
of	O
the	O
most	O
important	O
open	O
problems	O
in	O
the	O
mathematical	O
subfield	O
known	O
as	O
"	O
algebraic	O
computing	O
complexity	O
"	O
.	O
</s>
<s>
In	O
addition	O
,	O
PIT	O
has	O
applications	O
to	O
Tutte	O
matrices	O
and	O
also	O
to	O
primality	B-Algorithm
testing	I-Algorithm
,	O
where	O
PIT	O
techniques	O
led	O
to	O
the	O
AKS	B-Algorithm
primality	I-Algorithm
test	I-Algorithm
,	O
the	O
first	O
deterministic	O
(	O
though	O
impractical	O
)	O
polynomial	O
time	O
algorithm	O
for	O
primality	B-Algorithm
testing	I-Algorithm
.	O
</s>
