Back to Results
First PageMeta Content
Computer science / Theory of computation / Alan Turing / Models of computation / Computable function / Church–Turing thesis / Computability / Computational complexity theory / Computable number / Computability theory / Theoretical computer science / Mathematics


Computing over the Reals: Foundations for Scientific Computing Mark Braverman and Stephen Cook Introduction
Add to Reading List

Document Date: 2006-02-08 14:25:07

Open Document

File Size: 1,14 MB

Share Result on Facebook

Company

Google / /

/

Facility

University of Toronto / /

IndustryTerm

natural solution / polynomial-time algorithms / naïve algorithm / easy algorithms / physical device / polynomial time algorithm / machine computing / physical computational devices / Web turns / computing / commonly-used simplex algorithm / physical systems / scientific computing / program computing / /

Organization

Department of Computer Science / Distinguished University / University of Toronto / Extended Church / /

Person

Alan Turing / Julia Sets / Mark Braverman / Stephen Cook / /

Position

Professor / model of scientific computing / Travelling Salesman / suitable computational model for functions over the reals / bit model for computing functions / representative / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

D / R / C / /

ProvinceOrState

Connecticut / /

Technology

also easy algorithms / polynomial time algorithm / polynomial-time BSS algorithm / naïve algorithm / polynomial-time algorithms / Random Access / /

SocialTag