Sciweavers

2200 search results - page 78 / 440
» Bloch's Constant is Computable
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
On the Power of the Multiple Associative Computing (MASC) Model Related to That of Reconfigurable Bus-Based Models
: The MASC model is a multi-SIMD model that uses control parallelism to coordinate the interaction of data parallel threads. It supports a generalized associative style of parallel...
Mingxian Jin, Johnnie W. Baker
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 4 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
FOCS
2006
IEEE
15 years 4 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
STACS
2001
Springer
15 years 2 months ago
Randomness, Computability, and Density
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
AML
1998
60views more  AML 1998»
14 years 9 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl