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

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

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n11http://purl.org/net/nknouf/ns/bibtex#
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/ontology/domain/vavai/
n14https://schema.org/
n7http://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/
n6http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985807%3A_____%2F00%3A06000131%21RIV%2F2003%2FAV0%2FA06003%2FN/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n19http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985807%3A_____%2F00%3A06000131%21RIV%2F2003%2FAV0%2FA06003%2FN
rdf:type
n5:Vysledek skos:Concept
dcterms:description
Restricted branching programs are considered in complexity theory in order to study the space complexity of sequential computations and in applications as a data structure for Boolean functions. A model motivated by the investigation of the power of restricted parity nondeterminism in branching programs is studied. Exponentional lower bound for an explicit function and a strict hierarchy w.r.t. to the degree of the nondeterministic node is presented. Restricted branching programs are considered in complexity theory in order to study the space complexity of sequential computations and in applications as a data structure for Boolean functions. A model motivated by the investigation of the power of restricted parity nondeterminism in branching programs is studied. Exponentional lower bound for an explicit function and a strict hierarchy w.r.t. to the degree of the nondeterministic node is presented.
dcterms:title
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.
skos:prefLabel
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.
skos:notation
RIV/67985807:_____/00:06000131!RIV/2003/AV0/A06003/N
n3:strany
650;659
n3:aktivita
n12:P n12:Z
n3:aktivity
P(GA201/98/0717), Z(AV0Z1030915)
n3:dodaniDat
n19:2003
n3:domaciTvurceVysledku
n17:3559491
n3:druhVysledku
n8:D
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n6:predkladatel
n3:idSjednocenehoVysledku
703518
n3:idVysledku
RIV/67985807:_____/00:06000131
n3:jazykVysledku
n20:eng
n3:klicovaSlova
N/A
n3:klicoveSlovo
n13:N%2FA
n3:kontrolniKodProRIV
[D44503CF6F25]
n3:mistoKonaniAkce
Bratislava [SK]
n3:mistoVydani
Berlin
n3:nazevZdroje
Mathematical Foundations of Computer Science 2000, 25th International Symposium Proceedings.
n3:obor
n10:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n18:GA201%2F98%2F0717
n3:rokUplatneniVysledku
n19:2000
n3:tvurceVysledku
Sieling, D. Savický, Petr
n3:typAkce
n15:WRD
n3:zahajeniAkce
2000-08-28+02:00
n3:zamer
n7:AV0Z1030915
s:numberOfPages
10
n11:hasPublisher
Springer-Verlag
n14:isbn
3-540-67901-4