Computational complexity of the landscape I

Simple item page
dc.creatorDenef, Frederik
dc.creatorDouglas, Michael R.
dc.date2006-02-07
dc.date2006-02-16
dc.date.accessioned2026-07-07T10:45:54Z
dc.date.available2026-07-07T10:45:54Z
dc.descriptionWe 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.
dc.descriptionJHEP3 Latex, 53 pp, 2 .eps figures
dc.identifierhttps://arxiv.org/abs/hep-th/0602072
dc.identifierhttp://arxiv.org/abs/hep-th/0602072
dc.identifierAnnalsPhys.322:1096-1142,2007
dc.identifierdoi:10.1016/j.aop.2006.07.013
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/183057
dc.subjectHigh Energy Physics - Theory
dc.subjectComputational Complexity
dc.titleComputational complexity of the landscape I
dc.typetext

Files

Collections

arXiv