18306 search results - page 1 / 3662 » Algorithmics in Exponential Time |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional l...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...