38 search results - page 5 / 8 » Asymptotic analysis of (3, 2, 1)-shell sort |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
ASPLOS
1996
ACM
13 years 11 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
SIAMAM
2008
13 years 7 months ago
2008
Neural fields are an interesting option for modelling macroscopic parts of the cortex involving several populations of neurons, like cortical areas. Two classes of neural field equ...
AML
2008
13 years 7 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...