Results 11 to 20 of about 1,491,574 (265)
Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory [PDF]
, 2009 One of the central problems in quantum mechanics is to determine the ground state properties of a system of electrons interacting via the Coulomb potential.
A Auerbach +16 more
core +5 more sources
An Overview of the Theory of Computational Complexity [PDF]
Journal of the ACM, 1971 The purpose of this paper is to outline the theory of computational complexity which has emerged as a comprehensive theory during the last decade. This theory is concerned with the quantitative aspects of computations and its central theme is the measuring of the difficulty of computing functions.
Hartmanis, J., Hopcroft, J. E.
openaire +3 more sources
Harnessing Computational Complexity Theory to Model Human Decision‐making and Cognition [PDF]
Cognitive Sciences, 2023 A central aim of cognitive science is to understand the fundamental mechanisms that enable humans to navigate and make sense of complex environments. In this letter, we argue that computational complexity theory, a foundational framework for evaluating ...
Juan Pablo Franco, Carsten Murawski
openalex +2 more sources
On The Computational Complexity of Self-Attention [PDF]
International Conference on Algorithmic Learning Theory, 2022 Transformer architectures have led to remarkable progress in many state-of-art applications. However, despite their successes, modern transformers rely on the self-attention mechanism, whose time- and space-complexity is quadratic in the length of the ...
Feyza Duman Keles +2 more
semanticscholar +1 more source
Computational Complexity in Algebraic Combinatorics [PDF]
arXiv.org, 2023 Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some beautiful ...
G. Panova
semanticscholar +1 more source
Meta-Mathematics of Computational Complexity Theory
Electron. Colloquium Comput. Complex.We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity bounds within theories of bounded arithmetic.
I. C. Oliveira
openaire +3 more sources
Nonequilibrium statistical mechanics and optimal prediction of partially-observed complex systems
New Journal of Physics, 2022 Only a subset of degrees of freedom are typically accessible or measurable in real-world systems. As a consequence, the proper setting for empirical modeling is that of partially-observed systems.
Adam Rupe +2 more
doaj +1 more source
Proof Compression and NP Versus PSPACE II: Addendum
Bulletin of the Section of Logic, 2022 In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic (HSC) with the horizontal compressing in the corresponding minimal Prawitz-style natural ...
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
P Systems with Evolutional Communication and Division Rules
Axioms, 2021 A widely studied field in the framework of membrane computing is computational complexity theory. While some types of P systems are only capable of efficiently solving problems from the class P, adding one or more syntactic or semantic ingredients to ...
David Orellana-Martín +2 more
doaj +1 more source
Computational Creativity and Aesthetics with Algorithmic Information Theory
Entropy, 2021 We build an analysis based on the Algorithmic Information Theory of computational creativity and extend it to revisit computational aesthetics, thereby, improving on the existing efforts of its formulation.
Tiasa Mondol, Daniel G. Brown
doaj +1 more source