This HTML5 document contains 47 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/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n15http://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#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985807%3A_____%2F03%3A06020142%21RIV%2F2004%2FGA0%2FA06004%2FN/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985807%3A_____%2F03%3A06020142%21RIV%2F2004%2FGA0%2FA06004%2FN
rdf:type
skos:Concept n16:Vysledek
dcterms:description
We propose an information-theoretic approach to proving lower bounds on the size of branching programs. The argument is based on Kraft type inequalities for the average amount of uncertainty about (or entropy of) a given input during the various stages of computation. We introduce a large class of 'balanced' branching programs and, using the suggested approach, prove that some explicit Boolean functions cannot be computed by balanced programs of polynomial size.... We propose an information-theoretic approach to proving lower bounds on the size of branching programs. The argument is based on Kraft type inequalities for the average amount of uncertainty about (or entropy of) a given input during the various stages of computation. We introduce a large class of 'balanced' branching programs and, using the suggested approach, prove that some explicit Boolean functions cannot be computed by balanced programs of polynomial size....
dcterms:title
On Uncertainity versus Size in Branching Programs. On Uncertainity versus Size in Branching Programs.
skos:prefLabel
On Uncertainity versus Size in Branching Programs. On Uncertainity versus Size in Branching Programs.
skos:notation
RIV/67985807:_____/03:06020142!RIV/2004/GA0/A06004/N
n3:strany
1851;1867
n3:aktivita
n5:Z n5:P
n3:aktivity
P(GA201/02/1456), P(GA201/98/0717), P(LN00A056), Z(AV0Z1030915)
n3:cisloPeriodika
N/A
n3:dodaniDat
n13:2004
n3:domaciTvurceVysledku
n18:3179133
n3:druhVysledku
n14:J
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
619524
n3:idVysledku
RIV/67985807:_____/03:06020142
n3:jazykVysledku
n10:eng
n3:klicovaSlova
computational complexity; branching programs; decision trees; lower bounds; kraft inequality; entropy
n3:klicoveSlovo
n9:branching%20programs n9:decision%20trees n9:lower%20bounds n9:computational%20complexity n9:entropy n9:kraft%20inequality
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[DB8C2BBBF144]
n3:nazevZdroje
Theoretical Computer Science
n3:obor
n12:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n8:LN00A056 n8:GA201%2F98%2F0717 n8:GA201%2F02%2F1456
n3:rokUplatneniVysledku
n13:2003
n3:svazekPeriodika
290
n3:tvurceVysledku
Žák, Stanislav Jukna, S.
n3:zamer
n15:AV0Z1030915
s:issn
0304-3975
s:numberOfPages
17