29908 search results - page 200 / 5982 » On the complexity of communication complexity |
165
click to vote
CSCLP
2005
Springer
16 years 2 days ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
197
click to vote
ICANN
2005
Springer
16 years 1 days ago
2005
Springer
Spike synchronisation and de-synchronisation are important for feature binding and separation at various levels in the visual system. We present a model of complex valued neuron ac...
140
click to vote
WEBI
2005
Springer
16 years 6 hour ago
2005
Springer
As the number of web services in repositories on the World Wide Web increases so will the number of complex configurations of web services. However, as the World Wide Web is dynam...
187
click to vote
COCO
2004
Springer
15 years 12 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
144
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...