Degrees and reducibilities of easy tally sets (Q5096899): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-58338-6_87 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1517491096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Printable 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: Sets with small generalized Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996675 / 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: Logarithmic advice classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of logarithmic advice complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous optimization problems and a polynomial hierarchy of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On helping by robust oracle machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibilities on tally and sparse sets / rank
 
Normal rank

Latest revision as of 22:46, 29 July 2024

scientific article; zbMATH DE number 7573203
Language Label Description Also known as
English
Degrees and reducibilities of easy tally sets
scientific article; zbMATH DE number 7573203

    Statements

    Identifiers