<s>
Lattice	B-Algorithm
sieving	I-Algorithm
is	O
a	O
technique	O
for	O
finding	O
smooth	O
values	O
of	O
a	O
bivariate	O
polynomial	O
over	O
a	O
large	O
region	O
.	O
</s>
<s>
It	O
is	O
almost	O
exclusively	O
used	O
in	O
conjunction	O
with	O
the	O
number	B-Algorithm
field	I-Algorithm
sieve	I-Algorithm
.	O
</s>
<s>
The	O
original	O
idea	O
of	O
the	O
lattice	B-Algorithm
sieve	I-Algorithm
came	O
from	O
John	O
Pollard	O
.	O
</s>
<s>
For	O
the	O
number	B-Algorithm
field	I-Algorithm
sieve	I-Algorithm
application	O
,	O
it	O
is	O
necessary	O
for	O
two	O
polynomials	O
both	O
to	O
have	O
smooth	O
values	O
;	O
this	O
is	O
handled	O
by	O
running	O
the	O
inner	O
loop	O
over	O
both	O
polynomials	O
,	O
whilst	O
the	O
special-q	O
can	O
be	O
taken	O
from	O
either	O
side	O
.	O
</s>
