16666 search results - page 307 / 3334 » Descriptive and Computational Complexity |
174
click to vote
STOC
2005
ACM
16 years 7 days 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...
160
click to vote
MFCS
2005
Springer
16 years 5 days 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...
186
click to vote
ARITH
1999
IEEE
15 years 11 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...
163
click to vote
FLAIRS
1998
15 years 8 months ago
1998
In somecomplexdomains,like the gameof Go,evaluating a position is not simple. In other games,like Chessfor example,material balancegives goodandfast to compute insight onthe value...
173
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...