rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Computational complexity
    sub title: a quantitative perspective
  name:
    name part: Zimand, Marius.
    role:
      role term: creator
  name:
    name part: ScienceDirect (Online service)
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  origin info:
    place:
      place term: ne
    place:
      place term: Amsterdam
    place:
      place term: Boston
    publisher: Elsevier
    date issued: 2004
    edition: 1st ed.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (xii, 340 pages)
  abstract: There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively. The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length. One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others. The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researc…
  table of contents: Contents -- Preface. -- 1. Preliminaries. -- 2. Abstract complexity theory. -- 3. P, NP, and E. -- 4. Quantum computation. -- 5. One-way functions, pseudo-random generators. -- 6. Optimization problems. -- A. Tail bounds. -- Bibliography. -- Index.
  note: Marius Zimand.
  note: Includes bibliographical references (pages 321-332) and index.
  subject:
    topic: Computational complexity
  subject:
    topic: Complexité de calcul (Informatique)
  subject:
    topic: COMPUTERS
    topic: Machine Theory
  subject:
    topic: Computational complexity
  classification: QA267.7 .Z55 2004eb
  classification: 511.352
  related item:
    title info:
      title: Computational complexity
    name:
      name part: Zimand, Marius.
    origin info:
      publisher: Amsterdam ; Boston : Elsevier, 2004
      edition: 1st ed.
    identifier: (OCoLC)56057801
  related item:
    title info:
      title: North-Holland mathematics studies ; 196
  identifier: 1423709357
  identifier: 9781423709350
  identifier: 9780444828415
  identifier: 0444828419
  identifier: 008047666X
  identifier: 9780080476667
  identifier: 107979:108021 Elsevier Science & Technology
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: N$T
    record creation date: 050627
    record change date: 20260326144834.6
    record identifier: in00005730196
    language of cataloging:
      language term: eng