本文に飛ぶ

年 〜
年

検索結果 5 件

Hardness of approximation between P and NP : hardcover

Hardness of approximation between P and NP : hardcover
紙図書
Aviad RubinsteinAssociation for Computing Machineryc2019
全国の図書館
  • 件名NP-complete problems Equilibrium Computer algorit...
  • 件名（識別子）NP-complete problems Equilibrium Computer algorit...

Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan. (Lecture notes in computer science ; 1001)

Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan. (Lecture notes in computer science ; 1001)
紙図書
Springerc1995.<MA41-A99>
国立国会図書館
  • 件名計算量理論. 多項式. 近似値. NP-complete problems. Computational complexity. A...

The golden ticket : P, NP, and the search for the impossible : pbk

The golden ticket : P, NP, and the search for the impossible : pbk
紙図書
Lance FortnowPrinceton University Press[2017], c2013
全国の図書館
  • 件名NP-complete problems Computer algorithms COMPUTER...
  • 件名（識別子）NP-complete problems Computer algorithms COMPUTER...

The golden ticket : P, NP, and the search for the impossible

The golden ticket : P, NP, and the search for the impossible
紙図書
Lance FortnowPrinceton University Pressc2013
全国の図書館
  • 件名NP-complete problems Computer algorithms COMPUTER...
  • 件名（識別子）NP-complete problems Computer algorithms COMPUTER...

Efficient checking of polynomials and proofs and the hardness of approximation problems

Efficient checking of polynomials and proofs and the hardness of approximation problems
紙図書
Madhu SudanSpringer-Verlagc1995
全国の図書館
  • 件名NP-complete problems Computational complexity Aut...
  • 件名（識別子）NP-complete problems Computational complexity Aut...

検索結果は以上です。

RSS