Advice (complexity)

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Arora, Sanjeev; Barak, Boaz (2009), Computational Complexity: A Modern Approach, Cambridge University Press, p. 113, ISBN 9780521424264, Zbl 1193.68112. <a href="9780521424264" target="_blank">9780521424264</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Reinhardt, Klaus; Allender, Eric (2000). "Making nondeterminism unambiguous". SIAM J. Comput. 29 (4): 1118–1131. CiteSeerX 10.1.1.55.3203. doi:10.1137/S0097539798339041. Zbl 0947.68063. <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Hemaspaandra, Lane A.; Ogihara, Mitsunori (2002). The complexity theory companion. Texts in Theoretical Computer Science. An EATCS Series. Berlin: Springer-Verlag. ISBN 3-540-67419-5. Zbl 0993.68042. <a href="3-540-67419-5" target="_blank">3-540-67419-5</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Lance Fortnow, A Little Theorem Archived 2019-08-05 at the Wayback Machine <a href="/wiki/Lance_Fortnow" target="_blank">/wiki/Lance_Fortnow</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
</ol>

Advice (complexity) open-in-new

Advice (complexity)