2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.CC2015★ 2 cited
Separating decision tree complexity from subcube partition complexity
Robin Kothari, David Racicot-Desloges, Miklos Santha
The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose de…
math.RT2014
Friezes and continuant polynomials with parameters
Véronique Bazier-Matte, David Racicot-Desloges, Tanna Sanchez
Frieze patterns (in the sense of Conway and Coxeter) are related to cluster algebras of type A and to signed continuant polynomials. In view of studying certain classes of cluster…