3946 search results - page 34 / 790 » The computational complexity of choice sets |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
B This paper examinesthe integration of computational complexity into gametheoretic models. Theexample focused on is the Prisoner’s Dilemma,repeated for a finite length of time....
114
click to vote
NIPS
2000
15 years 1 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
121
click to vote
ANTS
2006
Springer
15 years 3 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
TCS
2010
14 years 10 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...