## Derandomizing Dynamic Programming and Beyond

- Stasys Jukna
- Electronic Colloquium on Computational Complexity
- 2018

@inproceedings{Grigoriev1996RandomizedOL, title={Randomized Omega(n2) Lower Bound for Knapsack}, author={Dima Grigoriev and Marek Karpinski}, booktitle={STOC}, year={1996} }

- Published 1996 in STOC
DOI:10.1145/258533.258555

We prove f2(n2 ) complexity lower bound for the general model of randomized computation trees solving the Knapsack Problem, and more generally Restricted Integer Programming. This is the first nontrivial lower bound proven for this model of computation. The method of the proof depends crucially on the new technique for proving lower bounds on the border… CONTINUE READING

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=258555.

### Presentations referencing similar topics