Name
Abstract | ||
|---|---|---|
We demonstrate a lower bound technique for linear decision lists, which are decision lists where the queries are arbitrary linear threshold functions. We use this technique to prove an explicit lower bound by showing that any linear decision list computing the function $MAJ circ XOR$ requires size $2^{0.18 n}$. This completely answers an open question of Tur{u0027a}n and Vatan [FoCMu002797]. We also show that the spectral classes $PL_1, PL_infty$, and the polynomial threshold function classes $widehat{PT}_1, PT_1$, are incomparable to linear decision lists. |
Year | Venue | DocType |
|---|---|---|
2019 | Electronic Colloquium on Computational Complexity (ECCC) | Journal |
Volume | Citations | PageRank |
abs/1901.05911 | 0 | 0.34 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arkadev Chattopadhyay | 1 | 150 | 19.93 |
| Meena Mahajan | 2 | 688 | 56.90 |
| Mande Nikhil S. | 3 | 5 | 4.13 |
| Nitin Saurabh | 4 | 5 | 3.81 |