| Attributes | Values |
|---|
| rdf:type
| |
| 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. In this paper (parity,k)-branching programs and (disjunction,k)-branching programs are considered, i.e., branching programs starting with a parity- (disjunction-)node with a fan-out of k whose successors are k read-once branching programs. This model is motivated by the investigation of the power of nondeterminism in branching programs and of similar variants that have been considered as a data structure. Lower bound methods and hierarchy results for polynomial size (parity,k)- and (disjunction,k)-branching programs with respect to k are 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. In this paper (parity,k)-branching programs and (disjunction,k)-branching programs are considered, i.e., branching programs starting with a parity- (disjunction-)node with a fan-out of k whose successors are k read-once branching programs. This model is motivated by the investigation of the power of nondeterminism in branching programs and of similar variants that have been considered as a data structure. Lower bound methods and hierarchy results for polynomial size (parity,k)- and (disjunction,k)-branching programs with respect to k are presented. (en)
- Omezené rozhodovací diagramy jsou ve výpočtové složitosti zkoumány s cílem zkoumat prostorovou složitost sekvenčních výpočtů a v aplikacích jako datová struktura pro reprezentci Booleovských funkcí. V tomto článku jsou zkoumány (parity,k)-rozhodovací diagramy a (disjunktion,k)-rozhodovací diagramy, tj. rozhodovací diagramy začínající paritním nebo disjunktivním uzlem stupně k, jehož následníci jsou tvořeny k read-once rozhodovacími diagramy. Tento model je motivován studiem síly nedeterminismu v rozhodovacích diagramech jak z hlediska výpočtové složitosti tak z hlediska datových struktur. Jsou prezentovány metody pro dolní odhady a výsledek o hierarchii polynomiálně velkých (parity,k)-rozhodovacích diagramů a (disjunktion,k)-rozhodovacích diagramů vzhledem k parametru k. (cs)
|
| Title
| - A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
- Výsledek o hierarchii pro read-once rozhodovací diagramy s omezeným nedeterminismem paritního typu (cs)
- A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism (en)
|
| skos:prefLabel
| - A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
- Výsledek o hierarchii pro read-once rozhodovací diagramy s omezeným nedeterminismem paritního typu (cs)
- A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism (en)
|
| skos:notation
| - RIV/67985807:_____/05:00405528!RIV06-AV0-67985807
|
| http://linked.open.../vavai/riv/strany
| |
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| - P(LN00A056), Z(AV0Z10300504)
|
| http://linked.open...iv/cisloPeriodika
| |
| http://linked.open...vai/riv/dodaniDat
| |
| http://linked.open...aciTvurceVysledku
| |
| http://linked.open.../riv/druhVysledku
| |
| http://linked.open...iv/duvernostUdaju
| |
| http://linked.open...titaPredkladatele
| |
| http://linked.open...dnocenehoVysledku
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/67985807:_____/05:00405528
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - read-once branching programs; restricted parity nondeterminism; lower bounds on complexity; hierarchy (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...odStatuVydavatele
| |
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...i/riv/nazevZdroje
| - Theoretical Computer Science
|
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...vavai/riv/projekt
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...v/svazekPeriodika
| |
| http://linked.open...iv/tvurceVysledku
| - Savický, Petr
- Sieling, D.
|
| http://linked.open...n/vavai/riv/zamer
| |
| issn
| |
| number of pages
| |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)