A new recursion-theoretic characterization of the polytime functions (Q1207333): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetizing uniform \(NC\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Predictably Computable Functions / rank
 
Normal rank

Latest revision as of 15:40, 17 May 2024

scientific article
Language Label Description Also known as
English
A new recursion-theoretic characterization of the polytime functions
scientific article

    Statements

    A new recursion-theoretic characterization of the polytime functions (English)
    0 references
    0 references
    1 April 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    polytime functions
    0 references
    polynomial time computation
    0 references
    0 references
    0 references