Computability and the Implicit Function Theorem (Q4921433): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.entcs.2006.08.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2006.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965247588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3871201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5549137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability in linear algebra / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENTCS.2006.08.004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:22, 30 December 2024

scientific article; zbMATH DE number 6162033
Language Label Description Also known as
English
Computability and the Implicit Function Theorem
scientific article; zbMATH DE number 6162033

    Statements

    Computability and the Implicit Function Theorem (English)
    0 references
    10 May 2013
    0 references
    computable analysis
    0 references
    computability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers