Sciweavers

9842 search results - page 85 / 1969
» Problem complexity
Sort
View
CSR
2008
Springer
14 years 10 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
15 years 10 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
ICC
2007
IEEE
141views Communications» more  ICC 2007»
15 years 4 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
CC
2010
Springer
108views System Software» more  CC 2010»
14 years 10 months ago
Communication Complexity Under Product and Nonproduct Distributions
We solve an open problem in communication complexity posed by Kushilevitz and Nisan (1997). Let R (f) and D
Alexander A. Sherstov
LATIN
2000
Springer
15 years 1 months ago
Worst-Case Complexity of the Optimal LLL Algorithm
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
Ali Akhavi