7,821 results for Computational complexity theory - Wikipedia

arxiv.org/abs/0806.0601v1

Functoriality for the su(3) Khovanov homology

We prove that Morrison and Nieh's categorification of the su(3) quantum knot invariant is functorial with respect to tangle cobordisms. This is in contrast to the categorified su(2) theory, which was not functorial as originally defined. We use met...

arxiv.org/abs/2205.06439v1

AEON: A Method for Automatic Evaluation of NLP Test Cases

Due to the labor-intensive nature of manual test oracle construction, various automated testing techniques have been proposed to enhance the reliability of Natural Language Processing (NLP) software. In theory, these techniques mutate an existing tes...

www.bing.com/ck/a?!&&p=962f24a438dc62e86798d613b19b105b8373b3741e63498f8512b7e91e6563aeJmltdHM9MTc3MjU4MjQwMA&ptn=3&ver=2&hsh=4&fclid=11866f14-dc8f-6dab-024e-7806dd876c00&u=a1aHR0cHM6Ly93d3cuanN0b3Iub3JnL3N0YWJsZS8zMjE2ODQ2&ntb=1

Retrospectives: Whatever Happened to the Cambridge Capital ...

Whatever Happened to the Cambridge Capital Theory Controversies? Avi J. Cohen and G. C. Harcourt This feature addresses the history of economic words and ideas. The hope is to deepen the …

arxiv.org/abs/1407.8373v1

Optimal Hub Labeling is NP-complete

Distance labeling is a preprocessing technique introduced by Peleg [Journal of Graph Theory, 33(3)] to speed up distance queries in large networks. Herein, each vertex receives a (short) label and, the distance between two vertices can be inferred fr...

arxiv.org/abs/1302.4853v2

Consistency of Online Random Forests

As a testament to their success, the theory of random forests has long been outpaced by their application in practice. In this paper, we take a step towards narrowing this gap by providing a consistency result for online random forests....

arxiv.org/abs/cond-mat/0411029v2

Group theory and octupolar order in URu2Si2

Recent experiments on URu2Si2 show that the low-pressure hidden order is non-magnetic but it breaks time reversal invariance. Restricting our attention to local order parameters of 5f2 shells, we find that the best candidate for hidden order is sta...

arxiv.org/abs/2103.14828v1

Specialization morphisms

We define the notion of a specialization morphism from a locally noetherian analytic adic space to a scheme. This captures the (classical) specialization morphism associated to a formal scheme. There is a well behaved theory of compactifications and...

arxiv.org/abs/1910.11748v2

Theory of transformation-mediated twinning

High-density and nanosized deformation twins in face-centered cubic (fcc)materials can effectively improve the combination of strength and ductility. However, the microscopic dislocation mechanisms enabling a high twinnability remain elusive. Twinnin...

github.com/Garima13a/Kalman-Filters

Garima13a/Kalman-Filters

Kalman filtering, also known as linear quadratic estimation (LQE), is an algorithm that uses a series of measurements observed over time, containing statistical noise and other inaccuracies, and produces estimates of unknown variables that tend to be more accu…

arxiv.org/abs/1511.02241v3

General Relativity in Post Independence India

The most outstanding contribution to general relativity in this era came in 1953 (published in 1955 \cite{akr}) in the form of the Raychaudhri equation. It is in 1960s that the observations began to confront the eupherial theory and thus began explor...