https://en.formulasearchengine.com/index.php?action=history&feed=atom&title=Numerical_sign_problemNumerical sign problem - Revision history2026-04-15T18:09:13ZRevision history for this page on the wikiMediaWiki 1.43.0-wmf.28https://en.formulasearchengine.com/index.php?title=Numerical_sign_problem&diff=261062&oldid=preven>Omnipaedista: per MOS:CAPS2014-07-08T00:41:12Z<p>per <a href="/index.php?title=MOS:CAPS&action=edit&redlink=1" class="new" title="MOS:CAPS (page does not exist)">MOS:CAPS</a></p>
<a href="https://en.formulasearchengine.com/index.php?title=Numerical_sign_problem&diff=261062&oldid=22340">Show changes</a>en>Omnipaedistahttps://en.formulasearchengine.com/index.php?title=Numerical_sign_problem&diff=22340&oldid=preven>Chris the speller: per WP:HYPHEN, sub-subsection 3, points 3,4,5, replaced: strongly- → strongly (5) using AWB2013-12-03T18:08:56Z<p>per <a href="/index.php?title=WP:HYPHEN&action=edit&redlink=1" class="new" title="WP:HYPHEN (page does not exist)">WP:HYPHEN</a>, sub-subsection 3, points 3,4,5, replaced: strongly- → strongly (5) using <a href="/index.php?title=Testwiki:AWB&action=edit&redlink=1" class="new" title="Testwiki:AWB (page does not exist)">AWB</a></p>
<a href="https://en.formulasearchengine.com/index.php?title=Numerical_sign_problem&diff=22340&oldid=261061">Show changes</a>en>Chris the spellerhttps://en.formulasearchengine.com/index.php?title=Numerical_sign_problem&diff=261061&oldid=prev96.35.171.223: /* Methods for reducing the sign problem */ Quantum computers are not believed to be able to solve NP-complete problems in polynomial time.2012-04-11T06:55:18Z<p><span class="autocomment">Methods for reducing the sign problem: </span> Quantum computers are not believed to be able to solve NP-complete problems in polynomial time.</p>
<a href="https://en.formulasearchengine.com/index.php?title=Numerical_sign_problem&diff=261061">Show changes</a>96.35.171.223