13603 search results - page 6 / 2721 » On the Complexity of Computing Treelength |
COLING
1999
13 years 6 months ago
1999
ECCC
2011
13 years 1 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
APAL
2011
13 years 2 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
PC
2010
13 years 5 months ago
2010
The fat-tree is one of the topologies most widely used to build high-performance parallel computers. However, they are expensive and difficult to build. In this paper we propose t...