<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>15632</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>651</pageFirst>
    <pageLast>680</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>15</volume>
    <type>articler</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2016-04-20</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The PCP theorem for NP over the reals</title>
    <parentTitle language="eng">Foundations of Computational Mathematics</parentTitle>
    <identifier type="doi">10.1007/s10208-014-9188-x</identifier>
    <identifier type="url">http://link.springer.com/article/10.1007/s10208-014-9188-x?sa_campaign=email/event/articleAuthor/onlineFirst</identifier>
    <identifier type="issn">1615-3375</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <author>
      <firstName>Klaus</firstName>
      <lastName>Meer</lastName>
    </author>
    <submitter>
      <firstName>Klaus</firstName>
      <lastName>Meer</lastName>
    </submitter>
    <author>
      <firstName>Martijn</firstName>
      <lastName>Baartse</lastName>
    </author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Probabilistically checkable proofs Real and complex number computations PCP theorem Hilbert Nullstellensatz decision problem</value>
    </subject>
    <collection role="institutes" number="1201">FG Theoretische Informatik</collection>
  </doc>
</export-example>
