13603 search results - page 177 / 2721 » On the Complexity of Computing Treelength |
145
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
128
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
141
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
129
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
138
click to vote
ARITH
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper describes the application of high radix redundant CORDIC algorithms to complex logarithmic number system arithmetic. It shows that a CLNS addition can be performed with...