Computational complexity of the landscape: Part I

doi:10.1016/j.aop.2006.07.013

Title: Computational complexity of the landscape: Part I

Full Record
Similar

Abstract

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.

Authors:

Denef, Frederik ^[1]; Douglas, Michael R. ^[2]

NHETC and Department of Physics and Astronomy, Rutgers University, Piscataway, NJ 08855-0849 (United States). E-mail: frederik.denef@fys.kuleuven.be
NHETC and Department of Physics and Astronomy, Rutgers University, Piscataway, NJ 08855-0849 (United States) and I.H.E.S., Le Bois-Marie, Bures-sur-Yvette, 91440 (France). E-mail: mrd@physics.rutgers.edu

Publication Date:: Tue May 15 00:00:00 EDT 2007

OSTI Identifier:: 20976757

Resource Type:: Journal Article

Resource Relation:: Journal Name: Annals of Physics (New York); Journal Volume: 322; Journal Issue: 5; Other Information: DOI: 10.1016/j.aop.2006.07.013; PII: S0003-4916(06)00138-2; Copyright (c) 2006 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved; Country of input: International Atomic Energy Agency (IAEA)

Country of Publication:: United States

Language:: English

Subject:: 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; COSMOLOGICAL CONSTANT; COSMOLOGICAL MODELS; COSMOLOGY; STRING THEORY; UNIVERSE

Citation Formats


                    Denef, Frederik, and Douglas, Michael R. Computational complexity of the landscape: Part I.  United States: N. p., 2007. 
        Web.  doi:10.1016/j.aop.2006.07.013.

Copy to clipboard


                    Denef, Frederik, & Douglas, Michael R. Computational complexity of the landscape: Part I.  United States.  doi:10.1016/j.aop.2006.07.013.

Copy to clipboard


                    Denef, Frederik, and Douglas, Michael R. Tue .  
        "Computational complexity of the landscape: Part I".  United States.  
        doi:10.1016/j.aop.2006.07.013.

Copy to clipboard


                    
@article{osti_20976757,

  title        = {Computational complexity of the landscape: Part I},

  author       = {Denef, Frederik and Douglas, Michael R.},

  abstractNote = {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.},

  doi          = {10.1016/j.aop.2006.07.013},

  journal      = {Annals of Physics (New York)},

  number       = 5,

  volume       = 322,

  place        = {United States},

  year         = {Tue May 15 00:00:00 EDT 2007},

  month        = {Tue May 15 00:00:00 EDT 2007}

}

Copy to clipboard

Journal Article:

DOI: 10.1016/j.aop.2006.07.013

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Toward a fundamental theory of optimal feature selection: Part II - Implementation and computational complexity

Morgera, S.D. - IEEE Trans. Pattern Anal. Mach. Intell.; (United States)

Certain algorithms and their computational complexity are examined for use in a VLSI implementation of the real-time pattern classifier described in Part I of this work. The most computationally intensive processing is found in the classifier training mode wherein subsets of the largest and smallest eigenvalues and associated eigenvectors of the input data covariance pair must be computed. It is shown that if the matrix of interest is centrosymmetric and the method for eigensystem decomposition is operator-based, the problem architecture assumes a parallel form. Such a matrix structure is found in a wide variety of pattern recognition and speech andmore »« less
DOI: 10.1109/TPAMI.1987.4767870
A computational study of yttria-stabilized zirconia: I. Using crystal chemistry to search for the ground state on a glassy energy landscape

Dong, Yanhao ; Qi, Liang ; Li, Ju ; ... - Acta Materialia
Cited by 1
DOI: 10.1016/j.actamat.2017.01.006
Automating Embedded Analysis Capabilities and Managing Software Complexity in Multiphysics Simulation, Part I: Template-Based Generic Programming

Pawlowski, Roger P. ; Phipps, Eric T. ; Salinger, Andrew G. - Scientific Programming

An approach for incorporating embedded simulation and analysis capabilities in complex simulation codes through template-based generic programming is presented. This approach relies on templating and operator overloading within the C++ language to transform a given calculation into one that can compute a variety of additional quantities that are necessary for many state-of-the-art simulation and analysis algorithms. An approach for incorporating these ideas into complex simulation codes through general graph-based assembly is also presented. These ideas have been implemented within a set of packages in the Trilinos framework and are demonstrated on a simple problem from chemical engineering.
DOI: 10.1155/2012/202071
Automating Embedded Analysis Capabilities and Managing Software Complexity in Multiphysics Simulation, Part I: Template-Based Generic Programming

Pawlowski, Roger P. ; Phipps, Eric T. ; Salinger, Andrew G. - Scientific Programming

An approach for incorporating embedded simulation and analysis capabilities in complex simulation codes through template-based generic programming is presented. This approach relies on templating and operator overloading within the C++ language to transform a given calculation into one that can compute a variety of additional quantities that are necessary for many state-of-the-art simulation and analysis algorithms. An approach for incorporating these ideas into complex simulation codes through general graph-based assembly is also presented. These ideas have been implemented within a set of packages in the Trilinos framework and are demonstrated on a simple problem from chemical engineering.
DOI: 10.1155/2012/202071
Calculational methods for nuclear heating. Part I. Theoretical and computational algorithms

Abdou, M.A. ; Maynard, C.W. - Nucl. Sci. Eng., v. 56, no. 4, pp. 360-380