Unbounded recursion and non-size-increasing functions (Q737105): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.entcs.2016.03.014 / rank
Normal rank
 
Property / author
 
Property / author: Stefano Mazzanti / rank
Normal rank
 
Property / author
 
Property / author: Stefano Mazzanti / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113317690 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2016.03.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2341184081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predecessor machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear types and non-size-increasing polynomial time computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOGSPACE and PTIME characterized by programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The iterated mod problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neat function algebraic characterizations of LOGSPACE and LINSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regressive computations characterize logarithmic space / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENTCS.2016.03.014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:32, 10 December 2024

scientific article
Language Label Description Also known as
English
Unbounded recursion and non-size-increasing functions
scientific article

    Statements

    Unbounded recursion and non-size-increasing functions (English)
    0 references
    5 August 2016
    0 references
    recursion on notation
    0 references
    logspace computable function
    0 references
    polynomial-time computable function
    0 references
    0 references

    Identifiers