Efficient checking of polynomials and proofs and the hardness of approximation problems
Zugl.: Berkeley, Univ., Diss., 1992
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | UnknownFormat |
| Sprache: | eng |
| Veröffentlicht: |
Berlin u.a.
Springer
1995
|
| Schriftenreihe: | Lecture notes in computer science
1001 |
| Schlagworte: |
Complexité de calcul (Informatique)
> Problèmes NP-complets
> Théorèmes - Démonstration automatique
> NP-complete problems
> Computational complexity
> Automatic theorem proving
> Komplexität
> Polynomapproximation
> Beweis
> Approximation
> Komplexitätsklasse
> NP-vollständiges Problem
> Polynomialzeitalgorithmus
> Optimierungsproblem
> Hochschulschrift
|
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Tag hinzufügen | Zusammenfassung: | Zugl.: Berkeley, Univ., Diss., 1992 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 advances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory. |
|---|---|
| Beschreibung: | XIV, 87 S. |
| ISBN: | 3540606157 3-540-60615-7 |