ON THE COMPLEXITY OF NUMERICAL ANALYSIS

Journal article

Open access

Peer reviewed

Eric ALLENDER, Peter BÜRGISSER, Johan KJELDGAARD-PEDERSEN and Peter Bro MILTERSEN

SIAM journal on computing, Vol.38(5), pp.1987-2006

2009

Abstract

Miscellaneous

Logic and foundations

Theoretical computing

Exact sciences and technology

Applied sciences

Algorithmics. Computability. Computer arithmetics

Mathematics

Mathematical logic, foundations, set theory

Recursion theory

Sciences and techniques of general use

Computer science; control theory; systems

url

https://doi.org/10.1137/070697926View

Version of Record (VoR) Open

11 Record Views

Title: ON THE COMPLEXITY OF NUMERICAL ANALYSIS
Creators: Eric ALLENDER - Department of Computer Science, Rutgers University, Piscataway, NJ 08854-8019, United States
Peter BÜRGISSER - Institute of Mathematics, Paderborn University, 33095 Paderborn, Germany
Johan KJELDGAARD-PEDERSEN - Decision Sciences Practice, PA Consulting Group, Tuborg Blvd. 5, 2900 Hellerup, Denmark
Peter Bro MILTERSEN - Department of Computer Science, University of Aarhus, IT-parken, 8200 Aarhus, Denmark
Publication Details: SIAM journal on computing, Vol.38(5), pp.1987-2006
Date published: 2009
Publisher: Society for Industrial and Applied Mathematics
Academic Unit: Computer Science (SAS)
Language: English
Resource Type: Journal article
Identifiers: 991031654558104646