Implicit characterizations of FPTIME and NC revisited (Q1044672): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147387242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436023 / 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: Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher type recursion, ramification and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function-algebraic characterizations of log and polylog parallel time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Implicit Characterization of NC k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934292 / 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: On the computational complexity of imperative programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\mu\)-measure as a tool for classifying computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control structures in programs and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realm of primitive recursion / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:16, 2 July 2024

scientific article
Language Label Description Also known as
English
Implicit characterizations of FPTIME and NC revisited
scientific article

    Statements

    Implicit characterizations of FPTIME and NC revisited (English)
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    bounded and ramified forms of recursion
    0 references
    function algebra
    0 references
    implicit computational complexity
    0 references
    NC
    0 references
    polynomial-time computability
    0 references
    0 references