10 citations · 10 across the 2 of their papers we have counts for
3 papers
quant-ph2018★ 10 cited
Round elimination in exact communication complexity
Jop Briët, Harry Buhrman, Debbie Leung +2
We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity. In particular, we conside…
math.OC2015
On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings
Sabine Burgdorf, Monique Laurent, Teresa Piovesan
We investigate structural properties of the completely positive semidefinite cone , consisting of all the symmetric matrices that admit a Gram repres…
q-bio.QM2012
A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees
Teresa Piovesan, Steven Kelk
Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6^r…