Computational complexity of the landscape. I.

DOI10.1016/j.aop.2006.07.013zbMath1113.83007arXivhep-th/0602072OpenAlexW1939025161WikidataQ56852349 ScholiaQ56852349MaRDI QIDQ877685

Michael R. Douglas, Frederik Denef

Publication date: 3 May 2007

Published in: Annals of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/hep-th/0602072

Mathematics Subject Classification ID

String and superstring theories in gravitational theory (83E30) String and superstring theories; other extended objects (e.g., branes) in quantum field theory (81T30) Einstein's equations (general structure, canonical formalism, Cauchy problems) (83C05)

Related Items

On finiteness of type IIB compactifications: magnetized branes on elliptic Calabi-Yau threefolds, Quantum computation vs. firewalls, Computational complexity of the landscape. II: Cosmological considerations, Inflation expels runaways, Bounding the heat trace of a Calabi-Yau manifold, Search optimization, funnel topography, and dynamical criticality on the string landscape, Computational complexity of the landscape. I., Proton decay, Yukawa couplings and underlying gauge symmetry in string theory, Moduli stabilization in non-geometric backgrounds, Orientifolds, hypercharge embeddings and the standard model, Early-time measure in eternal inflation, Data science applications to string theory, Quantum master equation for the vacuum decay dynamics, Explore and Exploit with Heterotic Line Bundle Models, Topological data analysis for the string landscape, Estimating Calabi-Yau hypersurface and triangulation counts with equation learners, Ising Machines for Diophantine Problems in Physics, A local Wheeler-DeWitt measure for the string landscape, Tuning and backreaction in F-term axion monodromy inflation, The dark universe after reheating in string inflation, Fluxes, vacua, and tadpoles meet Landau-Ginzburg and Fermat, Machine learning in the string landscape, Artificial neural network in cosmic landscape, Higgs bundles and UV completion in \(F\)-theory, Extremal bundles on Calabi-Yau threefolds, Higher spin de Sitter Hilbert space, Searching the landscape of flux vacua with genetic algorithms, Rigour and rigidity: Systematics on particle physics D6-brane models on ℤ₂× ℤ₆, On the computation of non-perturbative effective potentials in the string theory landscape - IIB/F-theory perspective -, Algorithmically solving the tadpole problem, Branes with brains: exploring string vacua with deep reinforcement learning, Polynomial roots and Calabi-Yau geometries, Holomorphic couplings in non-perturbative string compactifications, 6D (1,1) gauged supergravities from orientifold compactifications, Moduli stabilization in asymptotic flux compactifications, Classical transitions with the topological number changing in the early Universe, The self-organized critical multiverse, Accessibility measure for eternal inflation: dynamical criticality and higgs metastability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Critical points and supersymmetric vacua, III: String/M models
• The statistics of supersymmetric D-brane models
• Computational complexity of the landscape. I.
• BPP and the polynomial hierarchy
• Factoring polynomials with rational coefficients
• Noncomputability arising in dynamical triangulation model of four- dimensional quantum gravity
• Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
• Calabi-Yau four-folds for \(M\)- and \(F\)-theory compactifications
• PRIMES is in P
• Simulation of topological field theories by quantum computers
• Progress in quantum algorithms
• Fixing all moduli in a simple F-theory compactification
• de Sitter vacua in string theory
• The fundamental constants and their variation: observational and theoretical status
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• The importance of the P versus NP question
• Classical physics and the Church--Turing Thesis
• HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Threshold Computation and Cryptographic Security
• Computers, Rigidity, and Moduli
• The NP-completeness column
• Computational Complexity
• The cosmological constant problem
• Saltatory relaxation of the cosmological constant