Unsolved Problems
Showing 1-4 of 4 problems
OPG-36887
Open
Sums of independent random variables with unbounded variance
Conjecture If $X_1, \dotsc, X_n \geq 0$ are independent random variables with $\mathbb{E}[X_i] \leq \mu$, then $$\mathrm{Pr} \left( \sum X_i - \mathbb...
L1
OPG-36311
Open
Exponential Algorithms for Knapsack
Conjecture The famous 0-1 Knapsack problem is: Given $a_{1},a_{2},\dots,a_{n}$ and $b$ integers, determine whether or not there are $0-1$ values $x_{...
L1
OPG-467
Open
Complexity of square-root sum
Question What is the complexity of the following problem? Given $a_1,\dots,a_n; k$, determine whether or not $\sum_i \sqrt{a_i} \leq k.$...
L1
OPG-474
Open
Linear-size circuits for stable $0,1 < 2$ sorting?
Problem Can $O(n)$-size circuits compute the function $f$ on $\{0,1,2\}^*$ defined inductively by $f(\lambda) = \lambda$, $f(0x) = 0f(x)$, $f(1x) = 1f...
L1