English
Related papers

Related papers: Complexity Classes as Mathematical Axioms

200 papers

Except for crystalline or random structures, an agreed definition of complexity for intermediate and hence interesting cases does not exist. We fill this gap with a notion of complexity that characterises shapes formed by any finite number…

General Relativity and Quantum Cosmology · Physics 2024-05-14 Julian Barbour , Zaza Doborjginidze , Tim Koslowski , Hemant Shukla

We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…

Logic · Mathematics 2016-09-07 Harvey M. Friedman

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

Computational Complexity · Computer Science 2023-12-25 Rami Zaidan

For a smooth, closed $n$-manifold $M$, we define an upper semi-continuous integer-valued complexity function on $H^1(M;{\mathbb R})$ using Morse theory. This measures how far an integral class is from being a fiber of a fibration. The fact…

Geometric Topology · Mathematics 2015-06-08 Daryl Cooper , Stephan Tillmann

We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Carlos Gershenson

The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P - NP question and the "Deterministic" versus "Non Deterministic"…

Computational Complexity · Computer Science 2016-03-28 M. Rémon

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

Topological complexity is a numerical homotopy invariant that measures the instability of motion planning in a space. To study the topological complexity of non-simply connected spaces, Costa and Farber introduced a cohomology class whose…

Algebraic Topology · Mathematics 2026-03-11 Yuki Minowa

The class of the hypercomplex pseudo-Hermitian manifolds is considered. The flatness of the considered manifolds with the 3 parallel complex structures is proved. Conformal transformations of the metrics are introduced. The conformal…

Differential Geometry · Mathematics 2012-03-27 Kostadin Gribachev , Mancho Manev , Stancho Dimiev

We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…

Group Theory · Mathematics 2017-03-08 J. C. Birget

Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model…

Disordered Systems and Neural Networks · Physics 2013-05-29 S. N. Coppersmith

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Data Structures and Algorithms · Computer Science 2012-04-13 Vinícius G. P. de Sá , Guilherme D. da Fonseca , Raphael Machado , Celina M. H. de Figueiredo

We give some reductions among problems in (nonnegative) weighted #CSP which restrict the class of functions that needs to be considered in computational complexity studies. Our reductions can be applied to both exact and approximate…

Computational Complexity · Computer Science 2015-03-17 Andrei Bulatov , Martin Dyer , Leslie Ann Goldberg , Markus Jalsenius , Mark Jerrum , David Richerby

We show that various tameness assertions about abstract elementary classes imply the existence of large cardinals under mild cardinal arithmetic assumptions.

Logic · Mathematics 2016-10-20 Will Boney , Spencer Unger

We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…

Quantum Physics · Physics 2007-05-23 J. Maurice Rojas

A theory of topological gravity is a homotopy-theoretic representation of the Segal-Tillmann topologification of a two-category with cobordisms as morphisms. This note describes a relatively accessible example of such a thing, suggested by…

Differential Geometry · Mathematics 2007-05-23 Jack Morava

In physics, two systems that radically differ at short scales can exhibit strikingly similar macroscopic behaviour: they are part of the same long-distance universality class. Here we apply this viewpoint to geometry and initiate a program…

High Energy Physics - Theory · Physics 2023-11-22 Adam R. Brown , Michael H. Freedman , Henry W. Lin , Leonard Susskind

We prove an equivalence of categories from formal complex structures with formal holomorphic maps to homotopy algebras over a simple operad with its associated homotopy morphisms. We extend this equivalence to complex manifolds. A complex…

Algebraic Topology · Mathematics 2015-01-19 Joan Millès

A self-contained introduction is presented of the notion of the (abstract) differentiable manifold and its tangent vector fields. The way in which elementary topological ideas stimulated the passage from Euclidean (vector) spaces and linear…

Mathematical Physics · Physics 2012-04-12 K. Kanakoglou

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2016-09-07 Wesley Calvert