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: Lectures on proof verification and approximation algorithms
  name:
    name part: Mayr, Ernst.
  name:
    name part: Prömel, H. J.
  name:
    name part: Steger, Angelika.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  genre: Electronic resources (Books)
  origin info:
    place:
      place term: gw
    date issued: 1998
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (xii, 344 pages) : illustrations
  table of contents: Introduction to the theory of complexity and approximation algorithms / Thomas Jansen -- Introduction to randomized algorithms / Artur Andrzejak -- Derandomization / Detlef Sieling -- Proof checking and non-approximability / Stefan Hougardy -- Proving the PCP-theorem / Volker Heun, Wolfgang Merkle, Ulrich Weigand -- Parallel repetition of MIP(2,1) systems / Clemens Gröpl, Martin Skutella -- Bounds for approximating MAXLINEQ3-2 and MAXEkSAT / Sebastian Seibert, Thomas Wilke -- Deriving non-approximability results by reductions / Claus Rick, Hein Röhrig -- Optimal non-approximability of MAXCLIQUE / Martin Mundhenk, Anna Slobodová -- The hardness of approximating set cover / Alexander Wolff -- Semidefinite programming and its applications to approximation algorithms / Thomas Hofmeister, Martin Hühne -- Dense instances of hard optimization problems / Katja Wolf -- Polynomial time approximation schemes for geometric optimization problems in Euclidean metric spaces / Richard Mayr, Annette Schelten.
  note: Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (eds.).
  note: Electronic resource.
  note: Includes bibliographical references (pages 325-334) and indexes.
  subject:
    topic: Automatic theorem proving
  subject:
    topic: Computer algorithms
  subject:
    topic: Approximation theory
  subject:
    topic: problème optimisation
  subject:
    topic: vérification algorithme
  subject:
    topic: algorithme approximation
  subject:
    topic: Théorèmes
    topic: Démonstration automatique
  subject:
    topic: Algorithmes
  subject:
    topic: Approximation, Théorie de l'
  subject:
    topic: Approximation theory
  subject:
    topic: Automatic theorem proving
  subject:
    topic: Computer algorithms
  subject:
    topic: Automatische bewijsvoering
  subject:
    topic: Algoritmos e estruturas de dados
  subject:
    topic: Computabilidade e modelos de computacao
  subject:
    topic: Algorithmes
    topic: Congrès
  subject:
    topic: Complexité de calcul (Informatique)
    topic: Congrès
  subject:
    topic: Approximation, théorie de l'
    topic: Congrès
  subject:
    topic: Théorèmes
    topic: Démonstration automatique
    topic: Congrès
  subject:
    topic: Probabilistisch verifizierbarer Beweis
  subject:
    topic: Optimierungsproblem
  subject:
    topic: Approximationsalgorithmus
  subject:
    topic: Komplexitätsklasse NP
  classification: QA76.9.A96 L43 1998
  classification: 005.1/4
  classification: 54.10
  classification: 27
  classification: 28
  classification: DAT 532f
  classification: SS 4800
  related item:
    title info:
      title: Lecture notes in computer science ; 1367
  identifier: 3540642013
  identifier: 9783540642015
  identifier: 98014448
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: DLC
    record creation date: 980213
    record change date: 20190325093509.0
    record identifier: in00001426340
    language of cataloging:
      language term: eng