3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DS2017
On Convex Programming Relaxations for the Permanent
Damian Straszak, Nisheeth K. Vishnoi
In recent years, several convex programming relaxations have been proposed to estimate the permanent of a non-negative matrix, notably in the works of Gurvits and Samorodnitsky. Ho…
cs.DS2016★ 3 cited
Real Stable Polynomials and Matroids: Optimization and Counting
Damian Straszak, Nisheeth K. Vishnoi
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks in…
cs.FL2014★ 1 cited
Strong inapproximability of the shortest reset word
Pawel Gawrychowski, Damian Straszak
The Černý conjecture states that every -state synchronizing automaton has a reset word of length at most . We study the hardness of finding short reset words. It is kno…