Media type: Book; Thesis Title: Efficient checking of polynomials and proofs and the hardness of approximation problems Contributor: Sudan, Madhu [Author] imprint: Berlin [u.a.]: Springer, 1995 Published in: Lecture notes in computer science ; 1001 ACM distinguished theses Extent: XIV, 87 S. Language: English ISBN: 3540606157 RVK notation: SS 4800 : Lecture notes in computer science ST 130 : Allgemeines Keywords: Optimierungsproblem > NP-vollständiges Problem > Approximation > Polynomialzeitalgorithmus > Komplexitätsklasse > Beweis Polynomapproximation Origination: University thesis: Zugl.: Berkeley, Calif., Univ. of California, Diss., 1993 Footnote: Auf dem Umschlag: ACM distinguished theses. - Literaturverz. S. [73] - 78
Departmental Library DrePunct – stack Shelf-mark: R2016 8 3515 Item ID: 10011576 Status: Loanable, place order > Ordering possible ‒ please log in Delivery expected: 1 - 2 days after order