2168 search results - page 244 / 434 » Randomized Algorithms and Complexity Theory |
129
Voted
FC
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Participants in e-commerce and other forms of online collaborations tend to be selfish and rational, and therefore game theory has been recognized as particularly relevan...
154
Voted
DAGSTUHL
2007
15 years 5 months ago
2007
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
119
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
136
Voted
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
148
Voted
BMCBI
2011
14 years 10 months ago
2011
Background: As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical ge...