Results 71 to 80 of about 1,491,574 (265)
Uncertainty and computational complexity
Philosophical Transactions of the Royal Society of London. Biological Sciences, 2018 Modern theories of decision-making typically model uncertainty about decision options using the tools of probability theory. This is exemplified by the Savage framework, the most popular framework in decision-making research.
P. Bossaerts +2 more
semanticscholar +1 more source
, 2019 We believe that economic design and computational complexity---while already important to each other---should become even more important to each other with each passing year. But for that to happen, experts in on the one hand such areas as social choice,
A Appel +21 more
core +1 more source
Volume and complexity for Warped AdS black holes
Journal of High Energy Physics, 2018 We study the Complexity=Volume conjecture for Warped AdS3 black holes. We compute the spatial volume of the Einstein-Rosen bridge and we find that its growth rate is proportional to the Hawking temperature times the Bekenstein-Hawking entropy.
Roberto Auzzi +2 more
doaj +1 more source
Note on stability and holographic subregion complexity
European Physical Journal C: Particles and Fields, 2022 We study holographic subregion complexity in a spatially anisotropic field theory, which expresses a confinement-deconfinement phase transition. Its holographic dual is a five-dimensional anisotropic holographic model characterized by a Van der Waals ...
Mohammad Ali-Akbari, Mahsa Lezgi
doaj +1 more source
Interactions of computational complexity theory and mathematics
, 2023 $ $[This paper is a (self contained) chapter in a new book, Mathematics and Computation, whose draft is available on my homepage at https://www.math.ias.edu/avi/book ]. We survey some concrete interaction areas between computational complexity theory and different fields of mathematics.
openaire +2 more sources
Relativistic Computers and Non-uniform Complexity Theory [PDF]
, 2002 Recent research in theoretical physics on 'Malament-Hogarth space-times' indicates that so-called relativistic computers can be conceived that can carry out certain classically undecidable queries in finite time. We observe that the relativistic Turing machines which model these computations recognize precisely the ?2-sets of the Arithmetical Hierarchy.
van Leeuwen, J., Wiedermann, J.
openaire +3 more sources
On nonintegral vertices of 3-SAT problem relaxation polytope
Моделирование и анализ информационных систем, 2010 New facts characterizing the vertex set of 3-SAT problem relaxation polytope are established. In particular, the question of preservation of nonintegral vertices under additional linear constraints of stronger relaxations is examined.
A. V. Nikolaev
doaj
Canonical density matrix perturbation theory
, 2015 Density matrix perturbation theory [Niklasson and Challacombe, Phys. Rev. Lett. 92, 193001 (2004)] is generalized to canonical (NVT) free energy ensembles in tight-binding, Hartree-Fock or Kohn-Sham density functional theory. The canonical density matrix
Cawkwell, Marc J. +3 more
core +2 more sources
Why Philosophers Should Care About Computational Complexity [PDF]
, 2011 One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong.
Aaronson, Scott
core +4 more sources
An Improved Distributed Multi-User Cooperative Spectrum Sensing Method Based on DCS
Dianxin kexue, 2013 Distributed compressed sensing theory extends the application of compressed sensing theory, which brings single signal compression sampling to signal group compression sampling.
Jianwu Zhang, Xiaoyan Chen, Xiaorong Xu
doaj +2 more sources