Media type: E-Book Title: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems Contributor: Sudan, Madhu [Author] imprint: Berlin, Heidelberg: Springer Berlin Heidelberg, 1995 Published in: Lecture notes in computer science ; 1001 Bücher Extent: Online-Ressource Language: English DOI: 10.1007/3-540-60615-7 ISBN: 9783540484851 Identifier: RVK notation: SS 4800 : Lecture notes in computer science ST 130 : Allgemeines Keywords: Optimierungsproblem > NP-vollständiges Problem > Approximation > Polynomialzeitalgorithmus > Komplexitätsklasse > Beweis Origination: Footnote: