This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/projekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n10http://linked.opendata.cz/resource/domain/vavai/zamer/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F02%3A05020117%21RIV%2F2003%2FAV0%2FA05003%2FN/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F02%3A05020117%21RIV%2F2003%2FAV0%2FA05003%2FN
rdf:type
skos:Concept n15:Vysledek
dcterms:description
Lecture notes. Lecture notes.
dcterms:title
Probabilistic proofs and NP-completeness ( A course on the PCP theorem and itsconsequences ). Probabilistic proofs and NP-completeness ( A course on the PCP theorem and itsconsequences ).
skos:prefLabel
Probabilistic proofs and NP-completeness ( A course on the PCP theorem and itsconsequences ). Probabilistic proofs and NP-completeness ( A course on the PCP theorem and itsconsequences ).
skos:notation
RIV/67985840:_____/02:05020117!RIV/2003/AV0/A05003/N
n4:aktivita
n5:Z n5:P
n4:aktivity
P(GA201/01/1195), P(IAA1019901), P(LN00A056), P(ME 476), Z(AV0Z1019905), Z(MSM 113200005)
n4:dodaniDat
n12:2003
n4:domaciTvurceVysledku
n17:8679673
n4:druhVysledku
n16:V
n4:duvernostUdaju
n14:S
n4:entitaPredkladatele
n13:predkladatel
n4:idSjednocenehoVysledku
660297
n4:idVysledku
RIV/67985840:_____/02:05020117
n4:jazykVysledku
n11:eng
n4:klicovaSlova
computational complexity%approximation algorithms
n4:klicoveSlovo
n18:computational%20complexity%25approximation%20algorithms
n4:kontrolniKodProRIV
[02DDC10B78A3]
n4:mistoVydani
Praha
n4:objednatelVyzkumneZpravy
Charles University
n4:obor
n7:BA
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:pocetUcastnikuAkce
0
n4:pocetZahranicnichUcastnikuAkce
0
n4:projekt
n8:GA201%2F01%2F1195 n8:LN00A056 n8:ME%20476 n8:IAA1019901
n4:rokUplatneniVysledku
n12:2002
n4:tvurceVysledku
Sgall, Jiří
n4:verzeVyzkumneZpravy
(1)
n4:zamer
n10:AV0Z1019905 n10:MSM%20113200005
s:numberOfPages
30