skip to content
Limit theorems for convolutions. Preview this item
ClosePreview this item
Checking...

Limit theorems for convolutions.

Author: Harald Bergström
Publisher: Stockholm, Almqvist & Wiksell; New York, Wiley [1963]
Edition/Format:   Print book : EnglishView all editions and formats
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

Additional Physical Format: Online version:
Bergström, Harald.
Limit theorems for convolutions.
Stockholm, Almqvist & Wiksell; New York, Wiley [1963]
(OCoLC)624511812
Document Type: Book
All Authors / Contributors: Harald Bergström
OCLC Number: 1305677
Description: 347 pages diagrams 24 cm

Reviews

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

Tags

Be the first.

Similar Items

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/1305677> # Limit theorems for convolutions.
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "1305677" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/sw> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/2174583#Place/stockholm> ; # Stockholm
   library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
   schema:about <http://experiment.worldcat.org/entity/work/data/2174583#Topic/faltung_mathematik> ; # Faltung (Mathematik)
   schema:about <http://id.worldcat.org/fast/998881> ; # Limit theorems (Probability theory)
   schema:about <http://id.worldcat.org/fast/877310> ; # Convolutions (Mathematics)
   schema:about <http://dewey.info/class/517.5/> ;
   schema:bookFormat bgn:PrintBook ;
   schema:creator <http://viaf.org/viaf/109266551> ; # Harald Bergström
   schema:datePublished "1963" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/2174583> ;
   schema:inLanguage "en" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/624511812> ;
   schema:name "Limit theorems for convolutions."@en ;
   schema:productID "1305677" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/1305677#PublicationEvent/stockholm_almqvist_&_wiksell_new_york_wiley1963> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/2174583#Agent/almqvist_&_wiksell> ; # Almqvist & Wiksell
   schema:publisher <http://experiment.worldcat.org/entity/work/data/2174583#Agent/wiley> ; # Wiley
   umbel:isLike <http://bnb.data.bl.uk/id/resource/GB6403574> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/1305677> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
   schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/2174583#Agent/almqvist_&_wiksell> # Almqvist & Wiksell
    a bgn:Agent ;
   schema:name "Almqvist & Wiksell" ;
    .

<http://experiment.worldcat.org/entity/work/data/2174583#Topic/faltung_mathematik> # Faltung (Mathematik)
    a schema:Intangible ;
   schema:name "Faltung (Mathematik)"@en ;
    .

<http://id.worldcat.org/fast/877310> # Convolutions (Mathematics)
    a schema:Intangible ;
   schema:name "Convolutions (Mathematics)"@en ;
    .

<http://id.worldcat.org/fast/998881> # Limit theorems (Probability theory)
    a schema:Intangible ;
   schema:name "Limit theorems (Probability theory)"@en ;
    .

<http://viaf.org/viaf/109266551> # Harald Bergström
    a schema:Person ;
   schema:familyName "Bergström" ;
   schema:givenName "Harald" ;
   schema:name "Harald Bergström" ;
    .

<http://www.worldcat.org/oclc/624511812>
    a schema:CreativeWork ;
   rdfs:label "Limit theorems for convolutions." ;
   schema:description "Online version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/1305677> ; # Limit theorems for convolutions.
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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