7106 search results - page 364 / 1422 » Restricted Complexity, General Complexity |
131
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
143
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
It is to date an open question to know how the updating methods affect the evolution of a multi-agent system. This question has been tackled for various complex systems such as ce...
144
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
136
click to vote
TOG
2008
15 years 5 months ago
2008
This paper presents a new quadrangulation algorithm, extending the spectral surface quadrangulation approach where the coarse quadrangular structure is derived from the Morse-Smal...
161
click to vote
MOC
2002
15 years 4 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...