2016
DOI: 10.4086/cjtcs.2016.012
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Abstract: Abstract:In this note, we study the relationship between the parity decision tree complexity of a boolean function f , denoted by D ⊕ (f ), and the k-party number-in-hand multiparty communication complexity of the XOR-functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 15 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?