Back to Results
First PageMeta Content
Complexity classes / Polynomial / Advice / P / Reduction / Time complexity / Bounded-error probabilistic polynomial / Circuit complexity / Theoretical computer science / Computational complexity theory / Applied mathematics


On the Complexity of Numerical Analysis Eric Allender Rutgers, the State University of NJ Department of Computer Science Piscataway, NJ, USA
Add to Reading List

Document Date: 2008-12-08 14:23:03


Open Document

File Size: 262,22 KB

Share Result on Facebook

Company

iff AB / BP / Cox / /

/

Event

Force Majeure / Reorganization / /

Facility

Peter B¨urgisser Paderborn University Institute of Mathematics / Peter Bro Miltersen University of Aarhus Department / State University of NJ Department / /

IndustryTerm

deterministic algorithms / nonuniform polynomial time algorithms / stable algorithms / binary search / straight-line program computing / The latter algorithms / machine computing / deterministic algorithm / polynomial size computing / straight-line program computing f1 / computing / numerical computing community / numerically-stable algorithms / “good” algorithm / stable algorithm / /

Organization

Rutgers / University of Aarhus Department of Computer Science IT-parken / State University of NJ Department of Computer Science Piscataway / urgisser Paderborn University Institute of Mathematics DE-33095 Paderborn / PPP PPPP / /

Person

Graham / Johnson / Define Bn / Johan Kjeldgaard-Pedersen / Eric Allender Rutgers / Peter Bro / /

Position

Blum-Shub-Smale model / each machine computing / Prime Minister / standard SLP interpreter / analyst / Numerical Analyst / salesman / Euclidean Traveling Salesman / /

Technology

nonuniform polynomial time algorithms / RAM / numerically-stable algorithms / numerically stable algorithm / numerically stable algorithms / deterministic algorithm / The latter algorithms / simulation / /

SocialTag