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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds of the closeness between complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / 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: Redundancy in Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Sparse Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse hard sets for counting classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and closeness to complexity classes / rank
 
Normal rank

Revision as of 07:51, 4 July 2024

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