7,821 results for Computational complexity theory - Wikipedia

arxiv.org/abs/1609.03625v1

A varifold approach to surface approximation

We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we introduce the...

arxiv.org/abs/1711.09463v1

The Hohenberg-Kohn Theorem for Schrodinger Semigroups

At the basis of much of computational chemistry is density functional theory, as initiated by the Hohenberg-Kohn theorem. The theorem states that, when nuclei are fixed, nuclear potentials are determined by $1$-electron densities. We recast and deriv...

arxiv.org/abs/2012.11189v3

The ABC of Deutsch-Hayden Descriptors

It has been more than 20 years since Deutsch and Hayden proved the locality of quantum theory, using the Heisenberg picture of quantum computational networks. Of course, locality holds even in the face of entanglement and Bell's theorem. Today, most...

arxiv.org/abs/0709.1041v1

Rainich theory applied to m-rank tensors in n-dimensions

We show a tensorial-computational way to find out conditions that must fulfil an m-rank tensor in arbitrary dimension in order to be algebraically the energy-momentum tensor of some field. We apply in this paper our method to three 2-rank tensors:...

arxiv.org/abs/2301.05461v2

Hypergraph Horn functions

Horn functions form a subclass of Boolean functions possessing interesting structural and computational properties. These functions play a fundamental role in algebra, artificial intelligence, combinatorics, computer science, database theory, and log...

arxiv.org/abs/2311.06628v1

A decade of Density Functional Theory in Kenya

The African School Series on Electronic Structure Methods and Applications (ASESMA) has had a positive impact on growth of computational material science in Kenya, visibility of Kenyan universities and strong collaboration ties between Kenyan scienti...

github.com/srsahibzada/MATH491Fall2015

srsahibzada/MATH491Fall2015

MATH491: Computational Number Theory Group. Taylor Wilson, Daniel Whatley, and Sarah Sahibzada. Supervisor: Dr. Sara Pollock. (⭐ 1)

arxiv.org/abs/0812.4446v1

The Latent Relation Mapping Engine: Algorithm and Experiments

Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure Mapping Theory (SMT) and its implementation in the Structure Mapping...

arxiv.org/abs/cs/0002012v1

On The Closest String and Substring Problems

The problem of finding a center string that is `close' to every given string arises and has many applications in computational biology and coding theory. This problem has two versions: the Closest String problem and the Closest Substring problem. A...