Untitled

Yao, Penghui

doi:10.4086/cjtcs.2016.012

Chicago J. of Theoretical Comp. Sci.

2016

DOI: 10.4086/cjtcs.2016.012

|View full text |Cite

Untitled

Penghui Yao¹

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

Supporting

Mentioning

Contrasting

Publication Types

Select...

Relationship

Self Cite0

Independent0

Authors

Journals

Cited by 0 publications

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

No citations

Set email alert for when this publication receives citations?

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

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

Cited by 0 publications

References 15 publications

No citations

Contact Info

Product

Resources

About