Isbn: 9780821801314 - computational complexity theory (038) (proceedings of symposia in applied mathematics, band 38) (4 Ergebnisse)

Hardcover. Zustand: Very Good. Hbk, ix,128 p. Some light foxing mostly to end-papers and edges o/w a clean copy in very good condition. Contents : Overview of computational complexity theory / Juris Hartmanis -- The isomorphism conjecture and sparse sets / Stephen R. Mahaney -- Descriptive and computational complexity / Neil Immerman -- Complexity issues in crytography / Alan L. Selman -- Interactive proof systems / Shafi Goldwasser. [Congresses - American Mathematical Society Short Course, Computational Complexity Theory (1988 : Atlanta, Ga.] w104 / m166011.…

Hardcover. Zustand: Brand New. 128 pages. 10.50x7.25x0.75 inches. In Stock.

Zustand: New. Computational complexity theory is the study of the quantitative laws that govern computing. This book contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988. Editor(s): Hartmanis, Juris. Series: Proceedings of Symposia in Applied Mathematics. Num Pages: 128 pages. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Weight in Grams: 454. . 1989. Hardcover. . . . . Books ship from the US and Ireland. …

Zustand: New. In English.