paper

Computational Complexity of Vacua and Near-Vacua in Field and String Theory

arXiv:1809.08279 · doi:10.1103/PhysRevD.99.046015

Abstract

We demonstrate that the problems of finding stable or metastable vacua in a low energy effective field theory requires solving nested NP-hard and co-NP-hard problems, while the problem of finding near-vacua is in P. Multiple problems relevant for computing effective potential contributions from string theory are shown to be instances of NP-hard problems. If P NP, the hardness of finding string vacua is exponential in the number of scalar fields. Cosmological implications, including for rolling solutions, are discussed in light of a recently proposed measure.

9 pages. PRD Version

References in corpus (13)

Cited by in corpus (27)