Robust algorithms: a different approach to oracles (Q1063417): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Uwe Schoening / rank
Normal rank
 
Property / author
 
Property / author: Uwe Schoening / 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(85)90158-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988529552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691059 / 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: Quantitative Relativizations of Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Dominance Relations in Branch-and-Bound Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3957950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BPP and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sparse oracles for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Restricting the Size of Oracles Compared with Restricting Access to Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Helping”: several formalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3662618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank

Latest revision as of 18:58, 14 June 2024

scientific article
Language Label Description Also known as
English
Robust algorithms: a different approach to oracles
scientific article

    Statements

    Robust algorithms: a different approach to oracles (English)
    0 references
    1985
    0 references
    See the review of the preliminary version [Lect. Notes Comput. Sci. 172, 448-453 (1984; Zbl 0554.68034)].
    0 references
    0 references
    0 references
    0 references
    0 references
    oracle Turing machine
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references