AbstractTwo structurally defined types of NP-sets are studied. k-Simple sets are defined and shown to exist in NP. Other properties of these sets are investigated. k-Creative sets, as previously defined by Joseph and Young (1985), are next considered. A new condition is given which implies that a set is k-creative. Several previously considered NP-complete sets are proved to be k-creative
AbstractWe study the honest versions of polynomial time bounded many-one and Turing reducibility. We...
AbstractWe present a relatively simple proof of a result from Homer (1986) showing that if nonrecurs...
P versus NP is considered one of the great open problems of science. This consists in knowing the an...
AbstractTwo structurally defined types of NP-sets are studied. k-Simple sets are defined and shown t...
We obtain a new definition of creativeness for NP, called NP-creativeness. We show that all NP-creat...
AbstractWe study p-creative sets and p-completely creative sets. We first prove that for recursively...
AbstractWe present two results about witness functions for sets in NP and coNP. First, any set that ...
A simple technique is developed for manipulating the relative complexity of sets with respect to pol...
There are two parts to this dissertation. The first part is motivated by nothing less than a reexami...
AbstractWe consider under the assumption P ≠ NP questions concerning the structure of the lattice of...
Creative sets (or the complete recursively enumerable sets) play an important role in logic and mat...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
AbstractWhether or not P is properly included in NP is currently one of the most important open prob...
En este artículo se presenta una visión general a los últimos resultados acontecidos en el área de l...
AbstractCreative sets or the complete recursively enumerable sets play an important role in logic an...
AbstractWe study the honest versions of polynomial time bounded many-one and Turing reducibility. We...
AbstractWe present a relatively simple proof of a result from Homer (1986) showing that if nonrecurs...
P versus NP is considered one of the great open problems of science. This consists in knowing the an...
AbstractTwo structurally defined types of NP-sets are studied. k-Simple sets are defined and shown t...
We obtain a new definition of creativeness for NP, called NP-creativeness. We show that all NP-creat...
AbstractWe study p-creative sets and p-completely creative sets. We first prove that for recursively...
AbstractWe present two results about witness functions for sets in NP and coNP. First, any set that ...
A simple technique is developed for manipulating the relative complexity of sets with respect to pol...
There are two parts to this dissertation. The first part is motivated by nothing less than a reexami...
AbstractWe consider under the assumption P ≠ NP questions concerning the structure of the lattice of...
Creative sets (or the complete recursively enumerable sets) play an important role in logic and mat...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
AbstractWhether or not P is properly included in NP is currently one of the most important open prob...
En este artículo se presenta una visión general a los últimos resultados acontecidos en el área de l...
AbstractCreative sets or the complete recursively enumerable sets play an important role in logic an...
AbstractWe study the honest versions of polynomial time bounded many-one and Turing reducibility. We...
AbstractWe present a relatively simple proof of a result from Homer (1986) showing that if nonrecurs...
P versus NP is considered one of the great open problems of science. This consists in knowing the an...