9842 search results - page 261 / 1969 » The Complexity of the Matching-Cut Problem |
105
click to vote
CALC
2001
Springer
15 years 5 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...
108
click to vote
COCO
2009
Springer
15 years 7 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
97
Voted
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
77
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
96
Voted
ICFP
2006
ACM
16 years 16 days ago
2006
ACM
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...