Computational complexity of the landscape I
<|reference_start|>Computational complexity of the landscape I: 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.<|reference_end|>
@article{denef2006computational,
    title={Computational complexity of the landscape I},
    author={Frederik Denef (KU Leuven) and Michael R. Douglas (Rutgers and IHES)},
    journal={AnnalsPhys.322:1096-1142,2007},
    year={2006},
    doi={10.1016/j.aop.2006.07.013},
    archivePrefix={arXiv},
    eprint={hep-th/0602072},
    primaryClass={hep-th cs.CC}
}