We obtain a new definition of creativeness for NP, called NP-creativeness. We show that all NP-creative sets are NP-complete and provide strong evidence that all known NP-complete sets are NP-creative. We also show that all NP-creative sets are complete under exponentially honest reductions and contain an infinite NP subset in their complement (in other words, they are not NP-simple)
There are two parts to this dissertation. The first part is motivated by nothing less than a reexami...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
The paper gives examples of recursion categories which help illuminate the topics of creativeness a...
We obtain a new definition of creativeness for NP, called NP-creativeness. We show that all NP-creat...
AbstractTwo structurally defined types of NP-sets are studied. k-Simple sets are defined and shown t...
AbstractWe study p-creative sets and p-completely creative sets. We first prove that for recursively...
AbstractCreative sets or the complete recursively enumerable sets play an important role in logic an...
AbstractWe present two results about witness functions for sets in NP and coNP. First, any set that ...
Creative sets (or the complete recursively enumerable sets) play an important role in logic and mat...
A simple technique is developed for manipulating the relative complexity of sets with respect to pol...
AbstractWe show the following results regarding complete sets.•NP-complete sets and PSPACE-complete ...
AbstractUnder the assumption that NP does not have p-measure 0, we investigate reductions to NP-comp...
Reductions and completeness notions form the heart of computational complexity theory. Recently non-...
En este artículo se presenta una visión general a los últimos resultados acontecidos en el área de l...
This paper presents the following results on sets that are complete for $NP$. begin{enumerate} item...
There are two parts to this dissertation. The first part is motivated by nothing less than a reexami...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
The paper gives examples of recursion categories which help illuminate the topics of creativeness a...
We obtain a new definition of creativeness for NP, called NP-creativeness. We show that all NP-creat...
AbstractTwo structurally defined types of NP-sets are studied. k-Simple sets are defined and shown t...
AbstractWe study p-creative sets and p-completely creative sets. We first prove that for recursively...
AbstractCreative sets or the complete recursively enumerable sets play an important role in logic an...
AbstractWe present two results about witness functions for sets in NP and coNP. First, any set that ...
Creative sets (or the complete recursively enumerable sets) play an important role in logic and mat...
A simple technique is developed for manipulating the relative complexity of sets with respect to pol...
AbstractWe show the following results regarding complete sets.•NP-complete sets and PSPACE-complete ...
AbstractUnder the assumption that NP does not have p-measure 0, we investigate reductions to NP-comp...
Reductions and completeness notions form the heart of computational complexity theory. Recently non-...
En este artículo se presenta una visión general a los últimos resultados acontecidos en el área de l...
This paper presents the following results on sets that are complete for $NP$. begin{enumerate} item...
There are two parts to this dissertation. The first part is motivated by nothing less than a reexami...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
The paper gives examples of recursion categories which help illuminate the topics of creativeness a...
DOI
Add to ORKG