Efficient checking of polynomials and proofs and the hardness of approximation problems /

Bibliographic Details

Main Author:	Sudan, Madhu
Corporate Author:	SpringerLink (Online service)
Format:	eBook
Language:	English
Published:	Berlin [u.a.] : Springer, 1995.
Series:	Lecture notes in computer science ; 1001.
Subjects:	Polynomapproximation Optimierungsproblem NP-vollständiges Problem Approximation Polynomialzeitalgorithmus Komplexitätsklasse Beweis Electronic books.
Online Access:	Connect to the full text of this electronic book