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...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Traethawd Ymchwil Llyfr |
| Iaith: | English |
| Cyhoeddwyd: |
Berlin ; New York :
Springer?b-?sVerlag,
c1995.
|
| Cyfres: | Lecture notes in computer science ;
1001. |
| Pynciau: |
CARM 1 Store
| Rhif Galw: |
A2:AP19D0 C07236 |
|---|---|
| Copi 1 | Ar gael Gwneud Cais |