Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/cocoon/NakanishiHK00
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/cocoon/NakanishiHK00
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Kiyoharu_Hamaguchi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Masaki_Nakanishi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Toshinobu_Kashiwabara
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F3-540-44968-X%5F46
>
foaf:
homepage
<
https://doi.org/10.1007/3-540-44968-X_46
>
dc:
identifier
DBLP conf/cocoon/NakanishiHK00
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F3-540-44968-X%5F46
(xsd:string)
dcterms:
issued
2000
(xsd:gYear)
rdfs:
label
Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Kiyoharu_Hamaguchi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Masaki_Nakanishi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Toshinobu_Kashiwabara
>
swrc:
pages
467-476
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/cocoon/2000
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/cocoon/NakanishiHK00/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/cocoon/NakanishiHK00
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/cocoon/cocoon2000.html#NakanishiHK00
>
rdfs:
seeAlso
<
https://doi.org/10.1007/3-540-44968-X_46
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/cocoon
>
dc:
title
Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document