?url_ver=Z39.88-2004&rft_id=1995-31&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Result+Verification+Algorithms+for+Optimization+Problems.&rft.creator=Gupta%2C+H.&rft.subject=Data+Mining&rft.description=In+this+article+we+discuss+the+design+of+result+verification+algorithms+for+optimization+problems.+In+particular%2C+we+design+time-optimal+result+verification+algorithms+which+verify+the+solution+of+all-pairs+shortest+paths%2C+maximum-flow+in+a+network%2C+and+matching+problems.+We+prove+that+polynomial-time+verification+algorithms+for+NP-complete+problems+do+not+exist+exist%2C+unless+P+%3D+NP.+Result+verification+problems+for+most+of+the+NP-hard+problems+are+not+believed+to+be+in+NP.+W+e+also+consider+verification+algorithms+for+approximation+algorithms+for+NP-complete+and+NP-hard+problems.&rft.publisher=Stanford&rft.date=1995&rft.type=Techreport&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.identifier=http%3A%2F%2Filpubs.stanford.edu%3A8090%2F99%2F1%2F1995-31.pdf&rft.identifier=Gupta%2C+H.+(1995)+Result+Verification+Algorithms+for+Optimization+Problems.+Technical+Report.+Stanford.+(Publication+Note%3A+UIUC%2C+1995.)&rft.relation=http%3A%2F%2Filpubs.stanford.edu%3A8090%2F99%2F</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="http://ilpubs.stanford.edu:8090/cgi/export/99/COinS/ilprints-eprint-99.txt">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="http://ilpubs.stanford.edu:8090/cgi/export/99/COinS/ilprints-eprint-99.txt" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>