Computational Complexity of the Landscape I

DSpace/Manakin Repository

Computational Complexity of the Landscape I

Citable link to this page


Title: Computational Complexity of the Landscape I
Author: Douglas, Michael R.; Denef, Frederik

Note: Order does not necessarily reflect citation order of authors.

Citation: Denef, Frederik and Michael R. Douglas. 2007. Computational complexity of the landscape I. Annals of Physics 322(5): 1096-1142.
Full Text & Related Files:
Abstract: We study the computational complexity of the physical problem of finding vacua of string theory which agree with data, such as the cosmological constant, and show that such problems are typically NP hard. In particular, we prove that in the Bousso–Polchinski model, the problem is NP complete. We discuss the issues this raises and the possibility that, even if we were to find compelling evidence that some vacuum of string theory describes our universe, we might never be able to find that vacuum explicitly. In a companion paper, we apply this point of view to the question of how early cosmology might select a vacuum.
Published Version:
Other Sources:
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at
Citable link to this page:
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search