yr 〜
yr

Search results 3

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)
Paper図書
Springerc1995.<MA41-A99>
National Diet Library

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

Efficient checking of polynomials and proofs and the hardness of approximation problems
Paper図書
Madhu SudanSpringer-Verlagc1995
Other Libraries in Japan

Lecture notes in computer science

Lecture notes in computer science
Paper図書
Springer-Verlag
Other Libraries in Japan
  • Related Material...revised papers Efficient checking of polynomials and proofs and the hardness of approximation problems Job scheduling strategies for...

Reached to the end of result.