Quantum lower bounds by polynomials

Overview of attention for article published in Journal of the ACM, July 2001

Altmetric Badge

About this Attention Score

In the top 25% of all research outputs scored by Altmetric
High Attention Score compared to outputs of the same age (94th percentile)
Average Attention Score compared to outputs of the same age and source

Mentioned by

blogs: 1 blog
wikipedia: 8 Wikipedia pages

q&a: 3 Q&A threads

Readers on

mendeley: 140 Mendeley

So far, Altmetric has seen 3 Q&A posts from 3 users.

Randomized and deterministic query complexity of symmetric functions

Posted by permanganate, at cstheory.stackexchange.com, 09 May 2016

The deterministic query complexity $D(f)$ of a symmetric function $f$ is $\Omega(n)$ (except for f = 0 or f = 1). I am…

Bounding the gap between quantum and deterministic query complexity

Posted by Artem Kaznatcheev, at cstheory.stackexchange.com, 14 Apr 2011

Although exponential separations between bounded-error quantum query complexity ($Q(f)$) and deterministic query complexity ($D(f…

Open problems on the frontiers of TCS

Posted by Robin Kothari, at cstheory.stackexchange.com, 06 Sep 2010

In the thread Major unsolved problems in theoretical computer science?, Iddo Tzameret made the following excellent comment: …

This page shows the most recent Q&A posts that mention this research output. Click here to find out how to access more activity.