85 search results - page 8 / 17 » A note on circuit lower bounds from derandomization |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
ASPDAC
2005
ACM
13 years 10 months ago
2005
ACM
— The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
AML
2011
13 years 3 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
IPL
2010
13 years 7 months ago
2010
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...