Robust machines accept easy sets (Q914369): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with small generalized Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sets, Lowness and Highness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Relativizations of Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative relativizations of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes without machines: on complete languages for UP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse oracles separating feasible complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3356300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong nondeterministic polynomial-time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized Questions Involving Probabilistic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust algorithms: a different approach to oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Presburger arithmetic with fixed quantifier dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions on NP and p-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank

Latest revision as of 16:45, 20 June 2024

scientific article
Language Label Description Also known as
English
Robust machines accept easy sets
scientific article

    Statements

    Robust machines accept easy sets (English)
    0 references
    1990
    0 references
    0 references
    separation
    0 references
    robust oracle machines
    0 references
    nondeterministic polynomial-time Turing machines
    0 references
    relativizations
    0 references
    0 references
    0 references
    0 references