Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1809.08279 v2 pith:H2K33IZ7 submitted 2018-09-21 hep-th

classification hep-th
keywords problemsfindingstringtheoryvacuaeffectivefieldnear-vacua
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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 $\neq$ 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Axiverse Lampposts

    hep-ph 2026-02 conditional novelty 6.0 of 10

    In a hierarchical multi-axion theory with random couplings, axion field ranges shrink with 1/sqrt(N), generic axion–SM couplings are suppressed, but the QCD axion's coupling is unsuppressed.

Pith tools