>> Amazon.co.jp
このページのQRコード

Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems

種類:
電子ブック
責任表示:
edited by Madhu Sudan
出版情報:
Berlin, Heidelberg : Springer-Verlag, 1995
著者名:
シリーズ名:
Lecture Notes in Computer Science ; 1001
ISBN:
9783540484851 [354048485X]  CiNii Books  Calil
ローカル注記:
学内専用E-BOOKS (local access only)
オンライン
所蔵情報
Loading availability information
子書誌情報
Loading
タイトルが類似している資料

類似資料:

1
 
2
 
3
 
4
 
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
 

Sudan, Madhu., SpringerLink (Online service)

Springer Berlin Heidelberg : Imprint: Springer

Nori, Kesav V., Veni Madhavan, C. E., SpringerLink (Online service)

Springer-Verlag

Finkel, Alain, Jantzen, Matthias, SpringerLink (Online service)

Springer-Verlag

Havel, Ivan M., Koubek, Václav, SpringerLink (Online service)

Springer-Verlag

Prívara, Igor, Rovan, Branislav, Ruzička, Peter, SpringerLink (Online service)

Springer-Verlag

Bird, R. S., Morgan, C. C., Woodcock, J. C. P., SpringerLink (Online service)

Springer-Verlag

Plümer, Lutz, SpringerLink (Online service)

Springer-Verlag

Banieqbal, B., Barringer, H., Pnueli, A., SpringerLink (Online service)

Springer-Verlag

Mogavero, Fabio, SpringerLink (Online service)

Atlantis Press : Imprint: Atlantis Press