2446 search results - page 153 / 490 » Choiceless Polynomial Time |
150
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
151
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
CORR
2006
Springer
15 years 4 months ago
2006
Springer
For a given finite set of matrices with nonnegative integer entries we study the growth with t of max{ A1
135
click to vote
SCN
2008
Springer
15 years 4 months ago
2008
Springer
Collisions in the LPS cryptographic hash function of Charles, Goren and Lauter have been found by Z
128
click to vote
SIAMJO
2000
15 years 4 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...