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

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

Namespace Prefixes

PrefixIRI
n11http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n13http://purl.org/net/nknouf/ns/bibtex#
n10http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F09%3A10050646%21RIV13-MSM-11320___/
n20http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n21http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
n6http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F09%3A10050646%21RIV13-MSM-11320___
rdf:type
skos:Concept n21:Vysledek
dcterms:description
We define by a 2DNF formula a Boolean map from n bits to n+1 bits such that in any propositional proof system for which the PHP principle is hard, it is hard to prove about any n+1 string that it is outside of the range of the map. We define by a 2DNF formula a Boolean map from n bits to n+1 bits such that in any propositional proof system for which the PHP principle is hard, it is hard to prove about any n+1 string that it is outside of the range of the map.
dcterms:title
A proof complexity generator A proof complexity generator
skos:prefLabel
A proof complexity generator A proof complexity generator
skos:notation
RIV/00216208:11320/09:10050646!RIV13-MSM-11320___
n3:aktivita
n14:P n14:Z
n3:aktivity
P(IAA1019401), P(LC505), Z(MSM0021620839)
n3:dodaniDat
n5:2013
n3:domaciTvurceVysledku
n20:9626913
n3:druhVysledku
n8:D
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
301517
n3:idVysledku
RIV/00216208:11320/09:10050646
n3:jazykVysledku
n9:eng
n3:klicovaSlova
generator; complexity; proof
n3:klicoveSlovo
n4:complexity n4:proof n4:generator
n3:kontrolniKodProRIV
[363A578DC955]
n3:mistoKonaniAkce
Peking, Čína
n3:mistoVydani
Velká Británie
n3:nazevZdroje
Logic, Methodology and Pholosophy of Science: Proccedings Of The Thirteenth International Congress
n3:obor
n22:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n12:IAA1019401 n12:LC505
n3:rokUplatneniVysledku
n5:2009
n3:tvurceVysledku
Krajíček, Jan
n3:typAkce
n11:WRD
n3:zahajeniAkce
2007-08-19+02:00
n3:zamer
n6:MSM0021620839
s:numberOfPages
6
n13:hasPublisher
College Publications
n19:isbn
1-904987-45-1
n10:organizacniJednotka
11320