The computational complexity of the weak gravity conjecture
From MaRDI portal
Cites work
- A Tower Weak Gravity Conjecture from Infrared Consistency
- Alfred Tarski's elimination theory for real closed fields
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- An optimal convex hull algorithm in any fixed dimension
- Complexity in tame quantum theories
- Computational Complexity
- Computational complexity of norm-maximization
- Computational complexity of the landscape. I.
- Computational complexity of the landscape. II: Cosmological considerations
- Computational geometry. Algorithms and applications.
- Convex Polytopes
- Counting flux vacua
- Evidence for a sublattice weak gravity conjecture
- Formulating the weak gravity conjecture in AdS space
- How good are convex hull algorithms?
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Improved deterministic algorithms for linear programming in low dimensions
- Largest \(j\)-simplices in \(n\)-polytopes
- Merging the weak gravity and distance conjectures using BPS extremal black holes
- Neural network learning and quantum gravity
- On the complexity of four polyhedral set containment problems
- On the complexity of quantum field theory
- On the complexity of some basic problems in computational convexity. I. Containment problems
- On the computation of non-perturbative effective potentials in the string theory landscape -- IIB/F-theory perspective --
- On the geometry of the string landscape and the swampland
- Optimal scaling of balls and polyhedra
- P, NP, and NP-completeness. The basics of computational complexity.
- Running decompactification, sliding towers, and the distance conjecture
- Sharpening the weak gravity conjecture with dimensional reduction
- Taxonomy of infinite distance limits
- The convex hull swampland distance conjecture and bounds on non-geodesics
- The F-theory geometry with most flux vacua
- The minimal weak gravity conjecture
- The quickhull algorithm for convex hulls
- The statistics of string/M theory vacua
- The string landscape, black holes and gravity as the weakest force
- The Swampland: Introduction and Review
- The weak gravity conjecture and scalar fields
- Weak gravity bounds in asymptotic string compactifications
This page was built for publication: The computational complexity of the weak gravity conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907868)
