Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science)

Polynomials

Springer Berlin Heidelberg · 1995

Taschenbuch

ISBN-13: 978-3-540-60615-4

ISBN-10: 3-540-60615-7