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

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

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n5http://purl.org/net/nknouf/ns/bibtex#
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n18https://schema.org/
n13http://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/
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F10%3A00352483%21RIV11-MSM-67985840/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F10%3A00352483%21RIV11-MSM-67985840
rdf:type
n17:Vysledek skos:Concept
dcterms:description
In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings R_K. It was previously known that PSPACE, and hence BPP is Turing-reducible to R_K. The earlier proof relied on the adaptivity of the Turing-reduction to find a Kolmogorov-random string of polynomial length using the set R_K as oracle. Our new non-adaptive result relies on a new fundamental fact about the set R_K, namely each initial segment of the characteristic sequence of $R_K$ has high Kolmogorov complexity. As a partial converse to our claim we show that strings of very high Kolmogorov-complexity when used as advice are not much more useful than randomly chosen strings. In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings R_K. It was previously known that PSPACE, and hence BPP is Turing-reducible to R_K. The earlier proof relied on the adaptivity of the Turing-reduction to find a Kolmogorov-random string of polynomial length using the set R_K as oracle. Our new non-adaptive result relies on a new fundamental fact about the set R_K, namely each initial segment of the characteristic sequence of $R_K$ has high Kolmogorov complexity. As a partial converse to our claim we show that strings of very high Kolmogorov-complexity when used as advice are not much more useful than randomly chosen strings.
dcterms:title
Derandomizing from random strings Derandomizing from random strings
skos:prefLabel
Derandomizing from random strings Derandomizing from random strings
skos:notation
RIV/67985840:_____/10:00352483!RIV11-MSM-67985840
n3:aktivita
n14:Z n14:P
n3:aktivity
P(1M0545), P(GAP202/10/0854), P(IAA100190902), Z(AV0Z10190503)
n3:dodaniDat
n12:2011
n3:domaciTvurceVysledku
n19:5811694
n3:druhVysledku
n4:D
n3:duvernostUdaju
n15:S
n3:entitaPredkladatele
n21:predkladatel
n3:idSjednocenehoVysledku
253411
n3:idVysledku
RIV/67985840:_____/10:00352483
n3:jazykVysledku
n11:eng
n3:klicovaSlova
Kolmogorov random strings; reducibility; complexity classes
n3:klicoveSlovo
n10:Kolmogorov%20random%20strings n10:reducibility n10:complexity%20classes
n3:kontrolniKodProRIV
[0937B447BF60]
n3:mistoKonaniAkce
Cambridge
n3:mistoVydani
Los Alamitos
n3:nazevZdroje
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010
n3:obor
n20:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
4
n3:projekt
n7:IAA100190902 n7:1M0545 n7:GAP202%2F10%2F0854
n3:rokUplatneniVysledku
n12:2010
n3:tvurceVysledku
Buhrman, H. Koucký, Michal Fortnow, L. Loff, B.
n3:typAkce
n16:WRD
n3:wos
000286932700007
n3:zahajeniAkce
2010-06-09+02:00
n3:zamer
n13:AV0Z10190503
s:numberOfPages
6
n5:hasPublisher
IEEE Computer Society 2010
n18:isbn
978-0-7695-4060-3