Cargando…
Complexity and Random Matrix Approximations
<!--HTML-->Efforts to better understand the landscape and swampland can be stifled by computational complexity. I will discuss ways in which complexity could be overcome by learning random matrix approximations to string data, including both opportunities and caveats. As a concrete example, ge...
Autor principal: | Halverson, James |
---|---|
Lenguaje: | eng |
Publicado: |
2019
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2682615 |
Ejemplares similares
-
Analytic false-vacuum decay rate in the thin-wall approximation
por: Matteini, Marco
Publicado: (2022) -
Conformal and S-matrix bootstrap (1)
por: Augusto Penedones Fernandes, Joao Miguel
Publicado: (2017) -
Conformal and S-matrix bootstrap (2)
por: Augusto Penedones Fernandes, Joao Miguel
Publicado: (2017) -
Conformal and S-matrix bootstrap (4)
por: Augusto Penedones Fernandes, Joao Miguel
Publicado: (2017) -
Conformal and S-matrix bootstrap (3)
por: Augusto Penedones Fernandes, Joao Miguel
Publicado: (2017)