6274 search results - page 675 / 1255 » From query complexity to computational complexity |
208
click to vote
CSR
2010
Springer
16 years 4 days ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
147
click to vote
GD
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
181
click to vote
CA
2000
IEEE
15 years 11 months ago
2000
IEEE
In traditional animation, keyframes are modeled and standard graphics pipeline is used to animate the scene. In this paper we consider volume animation where the 30 world and its ...
199
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
235
Voted
MOBIHOC
2000
ACM
15 years 11 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....