Proceedings, Thirteenth Annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference), June 15-18, 1998, Buffalo, New York, USA

Author(s)

• IEEE Conference on Computational Complexity
• IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing
• ACM Special Interest Group for Automata and Computability Theory
• European Association for Theoretical Computer Science

Bibliographic Information

Proceedings, Thirteenth Annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference), June 15-18, 1998, Buffalo, New York, USA

sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM-SIGACT, EATCS

IEEE Computer Society, c1998

• : soft
• : case
• : microfiche

Note

"IEEE Catalog Number 98CB36247"--T.p. verso

Description and Table of Contents

Description

This text on computational complexity covers such topics as: structures of complexity classes; resource-bounded reducibilities; interactive proof systems; computational randomness; circuit complexity; proof complexity; communication complexity; complexity and learning; and Kolmogorov complexity.

by "Nielsen BookData"

Details

• NCID: BA37160970
• ISBN:
  • 0818683953
  • 0818683961
  • 081868397X
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Los Alamitos, Calif.
• Pages/Volumes: ix, 281 p.
• Size: 28 cm
• Classification:
  • LCC : QA267
  • DC20 : 511
• Subject Headings:
  • LCSH : Computational complexity -- Congresses