density functional theory 1electronic structure 1high-performance computing 1open-source software 1plane-wave methods 1pseudopotentials 1
From the 1 of 87 papers with an AI index.
29.3k citations
- Max Planck Institute for the Science of LightDE7 papers
- ETH ZurichCH4 papers
- University of KaiserslauternDE4 papers
- Forschungszentrum JülichDE3 papers
- Institute of PhysicsPL3 papers
- Technische Universität BerlinDE3 papers
- University of CambridgeGB3 papers
- University of GenevaCH3 papers
- Wrocław University of Science and TechnologyPL3 papers
- Arizona State UniversityUS2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Czech Technical University in PragueCZ2 papers
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2013★ 1 cited
Arithmetic Branching Programs with Memory
Stefan Mengel
We extend the well known characterization of $\vpws$ as the class of polynomials computed by polynomial size arithmetic branching programs to other complexity classes. In order to…
cs.CC2012★ 4 cited
Explicit Lower Bounds via Geometric Complexity Theory
Peter Bürgisser, Christian Ikenmeyer
We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the s…
cs.CC2008★ 1 cited
Kolmogorov Complexity Theory over the Reals
Martin Ziegler, Wouter M. Koolen
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing ma…