Efficient checking of polynomials and proofs and the hardness of approximation problems /
This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Thèse Livre |
| Langue: | English |
| Publié: |
Berlin ; New York :
Springer?b-?sVerlag,
c1995.
|
| Collection: | Lecture notes in computer science ;
1001. |
| Sujets: |
CARM 1 Store
| Cote: |
A2:AP19D0 C07236 |
|---|---|
| Exemplaire 1 | Disponible Réserver |