8196 search results - page 68 / 1640 » Computational Modeling and Complexity Science |
CCA
2009
Springer
15 years 4 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
CSR
2008
Springer
14 years 11 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...