The structure of logarithmic advice complexity classes (Q1275000): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower bounds for the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating Equivalence and Reducibility to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and degrees of tally sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the complexity of sparse and tally descriptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sets, Lowness and Highness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational power of neural networks: a characterization in terms of Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic advice classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets Truth-Table Reducible to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees and reducibilities of easy tally sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of infinite pseudorandom sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On helping by robust oracle machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference and truth-table hierarchies for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of the low and high hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instance complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analog computation via neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibilities on tally and sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank

Latest revision as of 18:00, 28 May 2024

scientific article
Language Label Description Also known as
English
The structure of logarithmic advice complexity classes
scientific article

    Statements

    The structure of logarithmic advice complexity classes (English)
    0 references
    0 references
    0 references
    12 January 1999
    0 references
    0 references
    logarithmic advice class
    0 references