One query reducibilities between partial information classes (Q2575741): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some connections between bounded query classes and non-uniform complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial terse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility classes of P-selective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounded frequency computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-reducibility and weak P-selectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Beigel's cardinality conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4785453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Membership Comparable Sets / 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

Latest revision as of 13:47, 11 June 2024

scientific article
Language Label Description Also known as
English
One query reducibilities between partial information classes
scientific article

    Statements

    One query reducibilities between partial information classes (English)
    0 references
    0 references
    0 references
    6 December 2005
    0 references
    cheatable language
    0 references
    partial information algorithm
    0 references

    Identifiers