DocServer

On the complexity of familiar functions and numbers

Borwein, Jonathan M. and Borwein, Peter (1988) On the complexity of familiar functions and numbers. SIAM review, 30 . pp. 589-601.

[img] PDF
Download (1632Kb)

    Abstract

    This paper examines low-complexity approximations to familiar functions and numbers. The intent is to suggest that it is possible to base a taxonomy of such functions and numbers on their computational complexity. A central theme is that traditional methods of approximation are often very far from optimal, while good or optimal methods are often very far from obvious. For most functions, provably optimal methods are not known; however the gap between what is known and what is possible is often small. A considerable number of open problems are posed and a number of related examples are presented.

    Item Type: Article
    Subjects: UNSPECIFIED
    Faculty: UNSPECIFIED
    Depositing User: Mrs Naghmana Tehseen
    Date Deposited: 20 Feb 2015 16:20
    Last Modified: 20 Feb 2015 16:20
    URI: https://docserver.carma.newcastle.edu.au/id/eprint/1593

    Actions (login required)

    View Item