2 papers
cs.CC2021
Hitting Sets and Reconstruction for Dense Orbits in and Circuits
Dori Medini, Amir Shpilka
In this paper we study polynomials in (polynomial-sized formulas) and in (polynomial-size depth- circuits) whose orbits, under the action of the affine group…
cs.DS2017
Ranked Enumeration of Minimal Triangulations
Noam Ravid, Dori Medini, Benny Kimelfeld
A tree decomposition of a graph facilitates computations by grouping vertices into bags that are interconnected in an acyclic structure, hence their importance in a plethora of pro…