Ranks of gauge groups and an NP-complete problem on the Landscape
From MaRDI portal
Publication:6238083
arXiv1212.3912MaRDI QIDQ6238083FDOQ6238083
Publication date: 17 December 2012
Abstract: We prove that the problem of determination of factor gauge groups given the rank of the gauge group at any given vacuum in the Landscape is in the computational complexity class NPC. This extends a result of Denef and Douglas on the computational complexity of determination of the value of the cosmological constant in the Landscape.
This page was built for publication: Ranks of gauge groups and an NP-complete problem on the Landscape
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6238083)
