This HTML5 document contains 37 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/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/ontology/domain/vavai/
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985807%3A_____%2F01%3A06010201%21RIV%2F2003%2FAV0%2FA06003%2FN/
n18http://linked.opendata.cz/resource/domain/vavai/zamer/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/kodPristupu/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
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#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985807%3A_____%2F01%3A06010201%21RIV%2F2003%2FAV0%2FA06003%2FN
rdf:type
skos:Concept n7:Vysledek
rdfs:seeAlso
www.eccc.uni-trier.de/eccc/
dcterms:description
Using an information-theoretic approach we prove a lower bound for so-called 'balanced' branching programs which for some classes of Boolean functions are more powerful than the most of previously considered restricted branching programs. The argument of the proof is based on an inequality for the average amount of uncertainty during the computation. Using an information-theoretic approach we prove a lower bound for so-called 'balanced' branching programs which for some classes of Boolean functions are more powerful than the most of previously considered restricted branching programs. The argument of the proof is based on an inequality for the average amount of uncertainty during the computation.
dcterms:title
On Uncertainty versus Size in Branching Programs. On Uncertainty versus Size in Branching Programs.
skos:prefLabel
On Uncertainty versus Size in Branching Programs. On Uncertainty versus Size in Branching Programs.
skos:notation
RIV/67985807:_____/01:06010201!RIV/2003/AV0/A06003/N
n3:aktivita
n19:Z n19:P
n3:aktivity
P(GA201/98/0717), P(LN00A056), Z(AV0Z1030915)
n3:dodaniDat
n15:2003
n3:domaciTvurceVysledku
n4:3179133
n3:druhVysledku
n14:A
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n20:predkladatel
n3:idSjednocenehoVysledku
690053
n3:idVysledku
RIV/67985807:_____/01:06010201
n3:jazykVysledku
n9:eng
n3:klicovaSlova
N/A
n3:klicoveSlovo
n10:N%2FA
n3:kodPristupu
n17:V
n3:kontrolniKodProRIV
[9664428D697A]
n3:obor
n5:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n11:GA201%2F98%2F0717 n11:LN00A056
n3:rokUplatneniVysledku
n15:2001
n3:tvurceVysledku
Jukna, S. Žák, Stanislav
n3:zamer
n18:AV0Z1030915
s:numberOfPages
0