Results 21 to 30 of about 1,379,053 (353)
Computational complexity of time-dependent density functional theory [PDF]
New Journal of Physics, 2014 Time-dependent density functional theory (TDDFT) is rapidly emerging as a premier method for solving dynamical many-body problems in physics and chemistry. The mathematical foundations of TDDFT are established through the formal existence of a fictitious
J D Whitfield +4 more
doaj +2 more sources
The Complexity of Infinite Computations In Models of Set Theory [PDF]
Logical Methods in Computer Science, 2009 We prove the following surprising result: there exist a 1-counter B\"uchi automaton and a 2-tape B\"uchi automaton such that the \omega-language of the first and the infinitary rational relation of the second in one model of ZFC are \pi_2^0-sets, while in a different model of ZFC both are analytic but non Borel sets.
Olivier Finkel
openalex +8 more sources
Holographic local quench and effective complexity [PDF]
Journal of High Energy Physics, 2018 We study the evolution of holographic complexity of pure and mixed states in 1 + 1-dimensional conformal field theory following a local quench using both the “complexity equals volume” (CV) and the “complexity equals action” (CA) conjectures.
Dmitry Ageev +3 more
doaj +12 more sources
Some Applications of Coding Theory in Computational Complexity
, 2004 Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory.
Luca Trevisan
openalex +6 more sources
The future of computational complexity theory: part II [PDF]
SIGA, 1996 Eric Allender +4 more
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
Quantum game theory and the complexity of approximating quantum Nash equilibria [PDF]
Quantum, 2022 This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information.
John Bostanci, John Watrous
doaj +1 more source