Back to Results
First PageMeta Content
Computational complexity theory / Quantum information science / Communication / Communication complexity / Quantum complexity theory / Parity function / Entropy / Circuit complexity / Decision tree model / Theoretical computer science / Applied mathematics / Mathematics


The non-adaptive query complexity of testing k-parities
Add to Reading List

Document Date: 2013-07-24 10:17:39

Open Document

File Size: 204,84 KB

Share Result on Facebook

City

Barcelona / Las Vegas / Mountain View / /

Company

Cambridge University Press / Bernstein / Google / Creative Commons / Yahoo! / /

Country

Netherlands / United States / Spain / /

Facility

Z IV BAR / University of Amsterdam / /

IndustryTerm

k-disjointness protocol / inner product / inner products / communication protocol / quantum protocols / public-randomness equality protocol / quantum algorithms / /

Organization

Cambridge University / University of Amsterdam / Organization for Scientific Research / European Commission / DED / CWI / /

Person

Harry Buhrman∗ David Garc / AVI W IGDERSON / DANIEL K ANE / RONALD DE W OLF / DAVID G ARC / M ATSLIAH / D. S IVAKUMAR / AVI K UMAR / Grigory Yaroslavtsev / RIC B LAIS / Joshua Brody / DANA RON / Srikanth Srinivasan / Harry Buhrman / Alice / David Woodruff / Paul Beame / Arie Matsliah / Wolf Licensed / David Garc / Pavel Pudlak / Then Bob / Shubhangi Saraf / /

Position

HB / expectation pm / model / /

ProgrammingLanguage

J / /

PublishedMedium

Theoretical Computer Science / Theory of Computing / /

Technology

H˚astadWigderson protocol / quantum protocols / quantum algorithms / random access / public-randomness equality protocol / communication protocol / k-disjointness protocol / /

URL

http /

SocialTag