Sciweavers

3913 search results - page 31 / 783
» complexity 2006
Sort
View
JDA
2006
59views more  JDA 2006»
13 years 7 months ago
A note on the complexity of minimum dominating set
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
Fabrizio Grandoni
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 8 months ago
The complexity of computing a Nash equilibrium
Constantinos Daskalakis, Paul W. Goldberg, Christo...
HICSS
2006
IEEE
115views Biometrics» more  HICSS 2006»
14 years 1 months ago
Defining Complexity Factors for the Architecture Evaluation Framework
Oleksiy Mazhelis, Jari A. Lehto, Jouni Markkula, M...