This HTML5 document contains 41 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/
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/resource/domain/vavai/subjekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F12%3A00377483%21RIV13-AV0-67985840/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n19http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F12%3A00377483%21RIV13-AV0-67985840
rdf:type
n15:Vysledek skos:Concept
dcterms:description
We prove an exponential lowerbound on the lengths of resolutionproofs of propositions expressing the finite Ramseytheorem for pairs. We prove an exponential lowerbound on the lengths of resolutionproofs of propositions expressing the finite Ramseytheorem for pairs.
dcterms:title
A lower bound on the size of resolution proofs of the Ramsey theorem A lower bound on the size of resolution proofs of the Ramsey theorem
skos:prefLabel
A lower bound on the size of resolution proofs of the Ramsey theorem A lower bound on the size of resolution proofs of the Ramsey theorem
skos:notation
RIV/67985840:_____/12:00377483!RIV13-AV0-67985840
n15:predkladatel
n16:ico%3A67985840
n3:aktivita
n6:I n6:P
n3:aktivity
I, P(GBP202/12/G061), P(IAA100190902)
n3:cisloPeriodika
14-15
n3:dodaniDat
n4:2013
n3:domaciTvurceVysledku
n13:8729174
n3:druhVysledku
n8:J
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
120287
n3:idVysledku
RIV/67985840:_____/12:00377483
n3:jazykVysledku
n11:eng
n3:klicovaSlova
computational complexity; Ramsey theorem; resolution proofs
n3:klicoveSlovo
n9:resolution%20proofs n9:Ramsey%20theorem n9:computational%20complexity
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[398E594E74E2]
n3:nazevZdroje
Information Processing Letters
n3:obor
n14:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n10:IAA100190902 n10:GBP202%2F12%2FG061
n3:rokUplatneniVysledku
n4:2012
n3:svazekPeriodika
112
n3:tvurceVysledku
Pudlák, Pavel
n3:wos
000305726800009
s:issn
0020-0190
s:numberOfPages
2
n19:doi
10.1016/j.ipl.2012.05.004