Title: Computational complexity of the landscape. I.
Authors: Denef, Frederik * ×
Douglas, Michael R * #
Issue Date: May-2007
Publisher: Academic press inc elsevier science
Series Title: Annals of physics vol:322 issue:5 pages:1096-1142
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. (c) 2006 Elsevier Inc. All rights reserved.
ISSN: 0003-4916
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Theoretical Physics Section
* (joint) first author
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science