



01300nas a2200169   4500008004100000245006300041210006300104260001500167300001100182490000700193520081800200100001401018700002001032700002401052700001701076856003701093       2017                        eng d00aFast optimization algorithms and the cosmological constant0 aFast optimization algorithms and the cosmological constant  c2017/11/13  a1035120 v963 a<p>Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of an NP-hard problem. The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable universe. Here we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10&minus;120 in a randomly generated 109 -dimensional ADK landscape.</p>1 aBao, Ning1 aBousso, Raphael1 aJordan, Stephen, P.1 aLackey, Brad  uhttps://arxiv.org/abs/1706.08503