Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4850544 / 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: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessible telephone directories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metafinite model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of higher-order types or, life without CONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902993 / rank
 
Normal rank

Revision as of 09:49, 6 July 2024

scientific article; zbMATH DE number 6156041
Language Label Description Also known as
English
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH
scientific article; zbMATH DE number 6156041

    Statements

    Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity
    0 references
    computability
    0 references
    sequential polynomial time
    0 references
    parallel polynomial time
    0 references
    0 references