Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Berlin New York
Springer-Verlag Association for Computing Machinery
c1995
|
| Series: | Lecture Notes in Computer Science / G. Goos and J. Hartmanis
1001 |
| Subjects: |
ΒΚΠ - Πατρα: ALFf
| Call Number: |
515.252 SUD |
|---|---|
| Copy 1 | Available |