Related papers: P-class is a proper subclass of NP-class; and more
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…
In this article, we discuss the question of whether P equals NP, we do not follow the line of research of many researchers, which is to try to find such a problem Q, and the problem Q belongs to the class of NP-complete, if the problem Q is…
In this paper we will continue the study of p-closed spaces. This class of spaces is strictly placed between the class of strongly compact spaces and the class of quasi-H-closed spaces. We will provide new characterizations of p-closed…
On example of tasks of class NP the questions concerning accuracy of work of already existing and possible in the future algorithms for the solution of tasks on discrete structures are considered.
A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.
In this article, I focus on the resiliency of the P=?NP problem. The main point to deal with is the change of the underlying logic from first to second-order logic. In this manner, after developing the initial steps of this change, I can…
This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and NL is not L. The point about this paper is the depend relation of the problem that need other problem's result to compute it. I show the structure of depend…
This paper presents a novel and straight formulation, and gives a complete insight towards the understanding of the complexity of the problems of the so called NP-Class. In particular, this paper focuses in the Searching of the Optimal…
Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure,…
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…
Let G be a finite group and p a prime dividing its order. We define new collections of p-subgroups of G. We study the homotopy relations among them and with the standard collections of p-subgroups. We determine their ampleness and sharpness…
The open question, P=NP?, was presented by Cook (1971). In this paper, a proof that P is not equal to NP is presented. In addition, it is shown that P is not equal to the intersection of NP and co-NP. Finally, the exact inclusion…
We investigate the separability of several well known classes of subgroups of the mapping class group of a surface.
This paper discusses why P and NP are likely to be different. It analyses the essence of the concepts and points out that P and NP might be diverse by sheer definition. It also speculates that P and NP may be unequal due to natural laws.
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…
In this paper, we study the structure of finite groups with a large number of conjugacy classes of $p$-elements for some prime $p$. As consequences, we obtain some new criteria for the existence of normal $p$-complements in finite groups.
Recall that a $p$-group of order $p^ {n} >p^ {3} $ is of maximal class, if its nilpotency class is $n-1$. In this paper, we study the $p$-groups of maximal class. Furthermore, we introduce a subgroup of a $p$-group of maximal class called…
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…