468 search results - page 17 / 94 » One-Way Functions in Complexity Theory |
136
click to vote
SIAMCOMP
2010
14 years 9 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
PCI
2001
Springer
15 years 3 months ago
2001
Springer
Formal modeling of complex systems is a non-trivial task, especially if a formal method does not facilitate separate development of the components of a system. This paper describes...
98
Voted
ENTCS
2010
14 years 11 months ago
2010
Service oriented computing is an accepted architectural style for developing large, distributed software systems. A particular promise of such architectures is service orchestrati...
MST
2007
14 years 10 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
CIE
2005
Springer
15 years 4 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...