Tuesday, December 18, 2012

1212.3912 (Abhijnan Rej)

Ranks of gauge groups and an NP-complete problem on the Landscape    [PDF]

Abhijnan Rej
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.
View original: http://arxiv.org/abs/1212.3912

No comments:

Post a Comment