15033 search results - page 112 / 3007 » Complexity Theory and Algorithms |
120
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
135
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
146
Voted
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
143
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
TSP
2008
15 years 3 months ago
2008
Over the past several years, there has been a renewed interest in complex orthogonal designs for their application in space-time block coding. Motivated by the success of this app...