Related papers: Inverse monoids associated with the complexity cla…
In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small…
A new class UF of problems is introduced, strictly included in the class NP, which arises in the analysis of the time verifying the intermediate results of computations. The implications of the introduction of this class are considered.…
We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…
The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the…
We present the MEoP problem that decides the existence of solutions to certain modular equations over prime numbers and show how this separates the complexity class NP from its subclass P
Ramified monoids are a class of monoids introduced by the authors. The main motivation for considering these monoids comes from knot theory, see [3, 4, 5]. Thus, in [2] we have studied the ramified monoids of the symmeytric group and of the…
Inspired by prior work of Bruinier and Ono and Mertens and Rolen, we study class polynomials for non-holomorphic modular functions arising from modular forms of negative weight. In particular, we give general conditions for the…
An attempt of a new kind of complexity anthropology is considered.
Inverse patchy colloids are nano- to micro-scale particles with a surface divided into differently charged regions. This class of colloids combines directional, selective bonding with a relatively simple particle design: owing to the…
In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…
The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…
In this paper, we introduce a new concept called left (right) g-MP inverse in a $*$-monoid. The relations of this type of generalized inverse with left inverse along an element are investigated. Also, the reverse order law for the inverse…
In this paper we study the complexity of solving a problem when a solution of a similar instance is known. This problem is relevant whenever instances may change from time to time, and known solutions may not remain valid after the change.…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
We consider inverse problems for $p$-Laplace type equations under monotonicity assumptions. In two dimensions, we show that any two conductivities satisfying $\sigma_1 \geq \sigma_2$ and having the same nonlinear Dirichlet-to-Neumann map…
This paper reviews recent results on hybrid inverse problems, which are also called coupled-physics inverse problems of multi-wave inverse problems. Inverse problems tend to be most useful in, e.g., medical and geophysical imaging, when…
I describe three geometric approaches to resolving variants of P v. NP, present several results that illustrate the role of group actions in complexity theory, and make a first step towards completely geometric definitions of complexity…
We investigate the problem of cryptanalysis as a problem belonging to the class NP. A class of problems UF is defined for which the time constructing any feasible solution is polynomial. The properties of the problems of NP, which may be…
The main purpose of this paper is investigating classes of acts that are injective relative to all embeddings with indecomposable domains or codomains. We give some homological classifications of monoids in light of such kinds of…
We consider the functional inverse of the Gamma function in the complex plane, where it is multi-valued, and define a set of suitable branches by proposing a natural extension from the real case.