On simple and creative sets in NP (Q1099614): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q161379
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Homer, Steven / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(86)90144-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005127553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-immune sets for complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5186732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immunity, Relativizations, and Nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on natural complete sets and Goedel numberings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle-dependent properties of the lattice of NP sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on witness functions for nonpolynomial and noncomplete sets in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness, Approximation and Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank

Latest revision as of 15:18, 18 June 2024

scientific article
Language Label Description Also known as
English
On simple and creative sets in NP
scientific article

    Statements

    On simple and creative sets in NP (English)
    0 references
    1986
    0 references
    Two 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 \textit{D. Joseph} and \textit{P. Young} [ibid. 39, 225-237 (1985; Zbl 0597.68042)], 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.
    0 references
    k-simple sets
    0 references
    k-creative sets
    0 references
    NP-complete sets
    0 references
    0 references

    Identifiers