<s>
In	O
computational	O
complexity	O
theory	O
,	O
a	O
fine-grained	B-Algorithm
reduction	I-Algorithm
is	O
a	O
transformation	O
from	O
one	O
computational	O
problem	O
to	O
another	O
,	O
used	O
to	O
relate	O
the	O
difficulty	O
of	O
improving	O
the	O
time	O
bounds	O
for	O
the	O
two	O
problems	O
.	O
</s>
<s>
Fine-grained	B-Algorithm
reductions	I-Algorithm
were	O
defined	O
,	O
in	O
the	O
special	O
case	O
that	O
and	O
are	O
equal	O
monomials	O
,	O
by	O
Virginia	O
Vassilevska	O
Williams	O
and	O
Ryan	O
Williams	O
in	O
2010	O
.	O
</s>
<s>
The	O
term	O
"	O
fine-grained	B-Algorithm
reduction	I-Algorithm
"	O
comes	O
from	O
later	O
work	O
by	O
Virginia	O
Vassilevska	O
Williams	O
in	O
an	O
invited	O
presentation	O
at	O
the	O
10th	O
International	O
Symposium	O
on	O
Parameterized	O
and	O
Exact	O
Computation	O
.	O
</s>
<s>
Although	O
the	O
original	O
definition	O
of	O
fine-grained	B-Algorithm
reductions	I-Algorithm
involved	O
deterministic	O
algorithms	O
,	O
the	O
corresponding	O
concepts	O
for	O
randomized	B-General_Concept
algorithms	I-General_Concept
and	O
nondeterministic	O
algorithms	O
have	O
also	O
been	O
considered	O
.	O
</s>
