13603 search results - page 180 / 2721 » On the Complexity of Computing Treelength |
134
click to vote
FCT
2001
Springer
15 years 9 months ago
2001
Springer
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynom...
108
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
134
click to vote
DCC
1993
IEEE
15 years 8 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
113
click to vote
BMCBI
2008
15 years 4 months ago
2008
ent> <title> <p>Highlights from the Fourth International Society for Computational Biology (ISCB) Student Council Symposium</p> </title> <editor>Lu...
131
click to vote
CC
2007
Springer
15 years 4 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...