Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/cjtcs/Yao16
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/cjtcs/Yao16
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Penghui_Yao
>
foaf:
homepage
<
http://cjtcs.cs.uchicago.edu/articles/2016/12/contents.html
>
dc:
identifier
DBLP journals/cjtcs/Yao16
(xsd:string)
dcterms:
issued
2016
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/cjtcs
>
rdfs:
label
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Penghui_Yao
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/cjtcs/Yao16/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/cjtcs/Yao16
>
rdfs:
seeAlso
<
http://cjtcs.cs.uchicago.edu/articles/2016/12/contents.html
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/cjtcs/cjtcs2016.html#Yao16
>
dc:
title
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
2016
(xsd:string)