Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan.

• Material Type: 図書
• ISBN: 3540606157 (Berlin : softcover : alk. paper)
• Title: Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan.
• Series Title: Lecture notes in computer science ; 1001
• Author Heading: Sudan, Madhu.
• Publication, Distribution, etc.: Berlin : Springer
• Publication Date: c1995.
• Publication Date (W3CDTF): 1995
• Extent: xiv, 87 p. ; 24 cm.
• Note (Dissertation): Based on the author's Ph. D. thesis, University of California, Berkeley, 1992.
• Place of Publication (Country Code): DE
• Text Language Code: eng
• Subject Heading: 計算量理論. Keisanryoriron.; 多項式. Takosiki.; 近似値. Kinziti.; NP-complete problems.; Computational complexity.; Automatic theorem proving.
• LCC: QA267
• DDC: 005.1/4/015113
• NDLC: MA41
• Note (Bibliography): Includes bibliographical references (p. [73]-78) and index.
• Holding library: 国立国会図書館
• Call No.: MA41-A99
• Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書; https://ndlsearch.ndl.go.jp
• Bibliographic ID (NDL): 000003244839; http://id.ndl.go.jp/bib/000003244839
• LC Control Number: 95050358; https://lccn.loc.gov/95050358
• Bibliographic Record Category (NDL): 211

Table of Contents

Table of Contents

1．　Introduction/ 1

1．1　Some problems related to polynomials/ 2

1．1．1　Proof verification/ 4

1．2　Program result checking/ 6