This HTML5 document contains 43 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://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/resource/domain/vavai/subjekt/
n10http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
n16http://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#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F11%3A00369674%21RIV12-AV0-67985840/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F11%3A00369674%21RIV12-AV0-67985840
rdf:type
n10:Vysledek skos:Concept
dcterms:description
We develop a new method for constructing models of bounded arithmetic and apply it to proof complexity. We develop a new method for constructing models of bounded arithmetic and apply it to proof complexity.
dcterms:title
Forcing with random variables and proof complexity Forcing with random variables and proof complexity
skos:prefLabel
Forcing with random variables and proof complexity Forcing with random variables and proof complexity
skos:notation
RIV/67985840:_____/11:00369674!RIV12-AV0-67985840
n10:predkladatel
n20:ico%3A67985840
n3:aktivita
n11:Z n11:P
n3:aktivity
P(IAA100190902), P(IAA1019401), P(LC505), Z(AV0Z10190503), Z(MSM0021620839)
n3:dodaniDat
n4:2012
n3:domaciTvurceVysledku
n14:9626913
n3:druhVysledku
n17:B
n3:duvernostUdaju
n7:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
200096
n3:idVysledku
RIV/67985840:_____/11:00369674
n3:jazykVysledku
n21:eng
n3:klicovaSlova
computational complexity; random variables; mathematical analysis
n3:klicoveSlovo
n5:random%20variables n5:mathematical%20analysis n5:computational%20complexity
n3:kontrolniKodProRIV
[C655AA92392E]
n3:mistoVydani
Cambridge
n3:nazevEdiceCisloSvazku
London Mathematical Society Lecture Note Series, 382
n3:nazevZdroje
Forcing with random variables and proof complexity
n3:obor
n12:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetStranKnihy
247
n3:pocetTvurcuVysledku
1
n3:projekt
n8:LC505 n8:IAA1019401 n8:IAA100190902
n3:rokUplatneniVysledku
n4:2011
n3:tvurceVysledku
Krajíček, Jan
n3:zamer
n16:MSM0021620839 n16:AV0Z10190503
s:numberOfPages
247
n13:hasPublisher
Cambridge University Press
n19:isbn
978-0-521-15433-8