9842 search results - page 119 / 1969 » Problem complexity |
DAGM
2003
Springer
15 years 3 months ago
2003
Springer
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of th...
HICSS
2005
IEEE
15 years 3 months ago
2005
IEEE
Decision making processes and systems to support the same have focused for the most part on narrow disciplines, paradigms, perspectives, and pre-determined processes. Apart from t...
105
click to vote
ICPADS
2007
IEEE
15 years 4 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
CALC
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...