検索結果をRefWorksへエクスポートします。対象は1件です。
Export
RT Book, Whole SR Print DC OPAC T1 Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan T2 Lecture notes in computer science A1 Sudan, Madhu YR 1995 FD c1995 SP xiv, 87 p. K1 NP-complete problems K1 Computational complexity K1 Automatic theorem proving PB Springer-Verlag PP Berlin ; New York SN 3540606157 LA English (英語) NO Bibliography: p. [73]-78 NO Includes index NO 書誌ID=1000531783; NCID=BA26600095; LK [OPAC]https://www.lib.sophia.ac.jp/opac/opac_link/bibid/1000531783 OL 30