The fault tolerance of NP-hard problems (Q553311): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5932324 / rank
 
Normal rank
Property / zbMATH Keywords
 
faulty data
Property / zbMATH Keywords: faulty data / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-hard sets
Property / zbMATH Keywords: NP-hard sets / rank
 
Normal rank
Property / zbMATH Keywords
 
left-set technique
Property / zbMATH Keywords: left-set technique / rank
 
Normal rank
Property / zbMATH Keywords
 
m-complete sets
Property / zbMATH Keywords: m-complete sets / rank
 
Normal rank
Property / zbMATH Keywords
 
btt-complete sets
Property / zbMATH Keywords: btt-complete sets / rank
 
Normal rank
Property / zbMATH Keywords
 
self-correctable
Property / zbMATH Keywords: self-correctable / rank
 
Normal rank
Property / zbMATH Keywords
 
p-closeness
Property / zbMATH Keywords: p-closeness / rank
 
Normal rank

Revision as of 13:09, 1 July 2023

scientific article
Language Label Description Also known as
English
The fault tolerance of NP-hard problems
scientific article

    Statements

    The fault tolerance of NP-hard problems (English)
    0 references
    0 references
    0 references
    0 references
    27 July 2011
    0 references
    faulty data
    0 references
    NP-hard sets
    0 references
    left-set technique
    0 references
    m-complete sets
    0 references
    btt-complete sets
    0 references
    self-correctable
    0 references
    p-closeness
    0 references

    Identifiers