2 citations · 2 across the 3 of their papers we have counts for
4 papers
Polynomial-time kernel reductions
Jeffrey Finkelstein, Benjamin Hescott
In the framework of computational complexity and in an effort to define a more natural reduction for problems of equivalence, we investigate the recently introduced kernel reductio…
More Tight Bounds for Active Self-Assembly Using an Insertion Primitive
Benjamin Hescott, Caleb Malchik, Andrew Winslow
We prove several limits on the behavior of a model of self-assembling particles introduced by Dabby and Chen (SODA 2013), called insertion systems, where monomers insert themselves…
The Complexity of Reasoning with FODD and GFODD
Benjamin J. Hescott, Roni Khardon
Recent work introduced Generalized First Order Decision Diagrams (GFODD) as a knowledge representation that is useful in mechanizing decision theoretic planning in relational domai…
Diffuse Reflection Diameter in Simple Polygons
Gill Barequet, Sarah M. Cannon, Eli Fox-Epstein +4
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number of diffuse reflections sufficient to illuminate the interior of any simple polygon with walls from a…