7,821 results for Computational complexity theory - Wikipedia

arxiv.org/abs/0802.0620v1

Formalism of Nonequilibrium Perturbation Theory and Kondo Effect

The formalism of nonequilibrium perturbation theory was constructed by Schwinger and Keldysh and then was developed with the diagrammatical technique by Lifshitz and Pitaevskii. Until now there has been widespread application to various researches...

arxiv.org/abs/0910.3792v1

An invitation to the theory of geometric functions

This note is an invitation to the theory of geometric functions. The foundation techniques and some of the developments in the field are explained with the mindset that the audience is principally young researchers wishing to understand some basics...

arxiv.org/abs/1111.1749v1

An invitation to algebraic topological string theory

The purpose of this note is to provide a short invitation to the universal algebraic approach to topological string theory. In the first section we make an attempt to explain the origin of this approach and how it fits into the bigger picture of full...

arxiv.org/abs/1803.06870v1

An invitation to higher Teichmüller theory

The goal of this article is to invite the reader to get to know and to get involved into higher Teichmüller theory by describing some of its many facets....

arxiv.org/abs/1907.08970v3

Versal deformations of pairs and Cohen-Macaulay approximation

For a pair (algebra, module) with equidimensional and isolated singularity we establish the existence of a versal henselian deformation. Obstruction theory in terms of an André-Quillen cohomology for pairs is a central ingredient in the Artin theory...

arxiv.org/abs/1610.03346v2

Notions of Anonymous Existence in Martin-Löf Type Theory

As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-Löf type theory cannot generally be shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do have unique...

arxiv.org/abs/2307.11286v1

Eliminating Unintended Stable Fixpoints for Hybrid Reasoning Systems

A wide variety of nonmonotonic semantics can be expressed as approximators defined under AFT (Approximation Fixpoint Theory). Using traditional AFT theory, it is not possible to define approximators that rely on information computed in previous itera...

arxiv.org/abs/0909.4876v1

A Program in Dialectical Rough Set Theory

A dialectical rough set theory focussed on the relation between roughly equivalent objects and classical objects was introduced in \cite{AM699} by the present author. The focus of our investigation is on elucidating the minimal conditions on the na...

arxiv.org/abs/1301.0647v1

Algebraic Semantics of Similarity-Based Bitten Rough Set Theory

We develop two algebraic semantics for bitten rough set theory (\cite{SW}) over similarity spaces and their abstract granular versions. Connections with choice based generalized rough semantics developed in \cite{AM69} by the present author and gener...

arxiv.org/abs/2301.01786v2

Is Yang-Mills Theory Unitary in Fractional Spacetime Dimensions?

We present concrete evidence that Yang-Mills theory exhibits non-unitarity in non-integer spacetime dimensions. This violation of unitarity stems from evanescent operators that, while vanishing in four dimensions, are non-zero in general d dimensions...

arxiv.org/abs/quant-ph/0406129v1

Quantum Game Theory in Finance

This is a short review of the background and recent development in quantum game theory and its possible application in economics and finance. The intersection of science and society is also discussed. The review is addressed to non--specialists....