research
∙
07/18/2022
Notes on Boolean Read-k and Multilinear Circuits
A monotone Boolean (AND,OR) circuit computing a monotone Boolean functio...
share
research
∙
12/23/2020
Sorting Can Exponentially Speed Up Pure Dynamic Programming
Many discrete minimization problems, including various versions of the s...
research
∙
12/23/2020
Approximation Limitations of Pure Dynamic Programming
We prove the first, even super-polynomial, lower bounds on the size of t...
research
∙
12/23/2020
Coin Flipping in Dynamic Programming is Almost Useless
We consider probabilistic circuits working over the real numbers, and us...
research
∙
12/20/2020
Notes on Hazard-Free Circuits
The problem of constructing hazard-free Boolean circuits (those avoiding...
research
∙
09/16/2020
Tropical Kirchhoff's Formula and Postoptimality in Matroid Optimization
Given an assignment of real weights to the ground elements of a matroid,...
research
∙
03/14/2018
Greedy can beat pure dynamic programming
Many dynamic programming algorithms for discrete 0-1 optimizationproblem...
research
∙
03/14/2018