7,821 results for Computational complexity theory - Wikipedia

arxiv.org/abs/1909.08382v3

Multiplicity one theorems for the generalized doubling method

In this work we prove the local multiplicity at most one theorem underlying the definition and theory of local $γ$-, $ε$- and $L$-factors, defined by virtue of the generalized doubling method, over any local field of characteristic 0. We also prese...

arxiv.org/abs/0812.3938v2

Perturbative nuclear physics

We present a new formulation of effective field theory for nucleon-nucleon (NN) interactions which treats pion interactions perturbatively, and we offer evidence that the expansion converges satisfactorily to third order in the expansion, which we...

arxiv.org/abs/math/0306193v3

From Sparks to Grundles--Differential Characters

We introduce a new homological machine for the study of secondary geometric invariants. The objects, called spark complexes, occur in many areas of mathematics. The theory is applied here to establish the equivalence of a large family of spark comp...

arxiv.org/abs/1112.3867v1

The use of information theory in evolutionary biology

Information is a key concept in evolutionary biology. Information is stored in biological organism's genomes, and used to generate the organism as well as to maintain and control it. Information is also "that which evolves". When a population adapts...

arxiv.org/abs/2201.02612v6

Natural Convection Heat Transfer from an Isothermal Plate

Using boundary-layer theory, natural convection heat transfer formulas which are accurate over a wide range of Rayleigh numbers ($Ra$) were developed in the 1970s and 1980s for vertical and downward-facing plates. A comprehensive formula for upward-f...

arxiv.org/abs/1601.03862v2

Complex Spacetimes and the Newman-Janis trick

In this thesis, we explore the subject of complex spacetimes, in which the mathematical theory of complex manifolds gets modified for application to General Relativity. We will also explore the mysterious Newman-Janis trick, which is an elementary an...

arxiv.org/abs/1009.1678v2

Enriched weakness

The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for existence. Th...

arxiv.org/abs/1311.3712v2

Homotopy locally presentable enriched categories

We develop a homotopy theory of categories enriched in a monoidal model category V. In particular, we deal with homotopy weighted limits and colimits, and homotopy local presentability. The main result, which was known for simplicially-enriched categ...

www.reddit.com/r/astrologymemes/comments/1prxva2/degree_theory/

Degree theory

...

arxiv.org/abs/1703.09381v2

Convex roof measures of coherence

We provide a general construction of convex roof measures of coherence. This construction is based on arbitrary coherence measures of pure states in the framework of resource theory of coherence. Convex roof measures of coherence bound from above all...

arxiv.org/abs/1208.1599v1

Algebraic K-theory of endomorphism rings

We establish formulas for computation of the higher algebraic $K$-groups of the endomorphism rings of objects linked by a morphism in an additive category. Let ${\mathcal C}$ be an additive category, and let $Y\ra X$ be a covariant morphism of object...

arxiv.org/abs/1210.2195v1

Annotating Answer-Set Programs in LANA?

While past research in answer-set programming (ASP) mainly focused on theory, ASP solver technology, and applications, the present work situates itself in the context of a quite recent research trend: development support for ASP. In particular, we pr...

arxiv.org/abs/2307.06777v3

Deciding Conjugacy of a Rational Relation

The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of conjugacy has bee...

arxiv.org/abs/1311.3353v2

SUNNY: a Lazy Portfolio Approach for Constraint Solving

*** To appear in Theory and Practice of Logic Programming (TPLP) *** Within the context of constraint solving, a portfolio approach allows one to exploit the synergy between different solvers in order to create a globally better solver. In this pap...