468 search results - page 47 / 94 » One-Way Functions in Complexity Theory |
157
click to vote
ICFCA
2004
Springer
15 years 9 months ago
2004
Springer
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
112
click to vote
NIPS
2000
15 years 5 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
114
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
110
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
142
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...