skip to content
Growth properties of a class of recursively defined functions Preview this item
ClosePreview this item
Checking...

Growth properties of a class of recursively defined functions

Author: Michael L Fredman; Stanford University. Computer Science Department.
Publisher: Stanford : Department of Computer Science, Stanford University, 1972.
Series: STAN-CS-, 72-296.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Michael L Fredman; Stanford University. Computer Science Department.
OCLC Number: 606104704
Series Title: STAN-CS-, 72-296.
Responsibility: by Michael L. Fredman.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/606104704> # Growth properties of a class of recursively defined functions
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "606104704" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/cau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/28491347#Place/stanford> ; # Stanford
   schema:about <http://id.worldcat.org/fast/1091984> ; # Recursive functions
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/28491347#Organization/stanford_university_computer_science_department> ; # Stanford University. Computer Science Department.
   schema:creator <http://experiment.worldcat.org/entity/work/data/28491347#Person/fredman_michael_l> ; # Michael L. Fredman
   schema:datePublished "1972" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/28491347> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/28491347#Series/stan_cs> ; # STAN-CS- ;
   schema:name "Growth properties of a class of recursively defined functions"@en ;
   schema:productID "606104704" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/606104704#PublicationEvent/stanford_department_of_computer_science_stanford_university_1972> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/28491347#Agent/department_of_computer_science_stanford_university> ; # Department of Computer Science, Stanford University
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/606104704> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/28491347#Agent/department_of_computer_science_stanford_university> # Department of Computer Science, Stanford University
    a bgn:Agent ;
   schema:name "Department of Computer Science, Stanford University" ;
    .

<http://experiment.worldcat.org/entity/work/data/28491347#Organization/stanford_university_computer_science_department> # Stanford University. Computer Science Department.
    a schema:Organization ;
   schema:name "Stanford University. Computer Science Department." ;
    .

<http://experiment.worldcat.org/entity/work/data/28491347#Person/fredman_michael_l> # Michael L. Fredman
    a schema:Person ;
   schema:familyName "Fredman" ;
   schema:givenName "Michael L." ;
   schema:name "Michael L. Fredman" ;
    .

<http://experiment.worldcat.org/entity/work/data/28491347#Series/stan_cs> # STAN-CS- ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/606104704> ; # Growth properties of a class of recursively defined functions
   schema:name "STAN-CS- ;" ;
    .

<http://id.worldcat.org/fast/1091984> # Recursive functions
    a schema:Intangible ;
   schema:name "Recursive functions"@en ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.