<s>
A	O
field-theoretic	B-Algorithm
simulation	I-Algorithm
is	O
a	O
numerical	O
strategy	O
to	O
calculate	O
structure	O
and	O
physical	O
properties	O
of	O
a	O
many-particle	O
system	O
within	O
the	O
framework	O
of	O
a	O
statistical	O
field	O
theory	O
,	O
like	O
e.g.	O
</s>
<s>
A	O
convenient	O
possibility	O
is	O
to	O
use	O
Monte	B-Application
Carlo	I-Application
(	O
MC	O
)	O
algorithms	O
,	O
to	O
sample	O
the	O
full	O
partition	O
function	O
integral	O
expressed	O
in	O
field-theoretic	O
representation	O
.	O
</s>
<s>
procedure	O
is	O
then	O
called	O
the	O
auxiliary	B-Algorithm
field	I-Algorithm
Monte	I-Algorithm
Carlo	I-Algorithm
method	O
.	O
</s>
<s>
However	O
,	O
it	O
is	O
well	O
known	O
that	O
MC	O
sampling	O
in	O
conjunction	O
with	O
the	O
basic	O
field-theoretic	O
representation	O
of	O
the	O
partition	O
function	O
integral	O
,	O
directly	O
obtained	O
via	O
the	O
Hubbard-Stratonovich	B-Algorithm
transformation	I-Algorithm
,	O
is	O
impracticable	O
,	O
due	O
to	O
the	O
so-called	O
numerical	O
sign	O
problem	O
(	O
Baeurle	O
2002	O
,	O
Fredrickson	O
2002	O
)	O
.	O
</s>
<s>
In	O
such	O
cases	O
special	O
analytical	O
and	O
numerical	O
techniques	O
are	O
required	O
to	O
accelerate	O
the	O
statistical	O
convergence	O
of	O
the	O
field-theoretic	B-Algorithm
simulation	I-Algorithm
(	O
Baeurle	O
2003	O
,	O
Baeurle	O
2003a	O
,	O
Baeurle	O
2004	O
)	O
.	O
</s>
<s>
Other	O
promising	O
field-theoretic	B-Algorithm
simulation	I-Algorithm
techniques	O
have	O
been	O
developed	O
recently	O
,	O
but	O
they	O
either	O
still	O
lack	O
the	O
proof	O
of	O
correct	O
statistical	O
convergence	O
,	O
like	O
e.g.	O
</s>
