Back to Results
First PageMeta Content
Complexity classes / Mathematical optimization / Structural complexity theory / Computability theory / P versus NP problem / NP-complete / NP / PP / Analog computer / Theoretical computer science / Computational complexity theory / Applied mathematics


THE COMPLEXITY OF ANALOG COMPUTATION † Anastasios VERGIS Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. Kenneth STEIGLITZ Department of Computer Science, Princeton University, Pr
Add to Reading List

Document Date: 2001-11-25 03:18:59

Open Document

File Size: 218,49 KB

Share Result on Facebook

Company

3SAT / /

Facility

Princeton University / University of Minnesota / /

IndustryTerm

mechanical devices / deterministic physical device / stored energy / minimum-length interconnection network / electrical network / physical devices / feasible solution / optimum solution / physical device / quantum-mechanical systems / mechanical device / /

Organization

Princeton University / Anastasios VERGIS Department of Computer Science / Strong Church / U.S.A. Bradley DICKINSON Department of Electrical Engineering / National Science Foundation / U.S.A. Kenneth STEIGLITZ Department of Computer Science / University of Minnesota / Minneapolis / United States Army / /

Position

forward / idealized mathematical model for the machine / /

Product

K-0577 / K-0549 / K-0275 / K-0095 / /

ProgrammingLanguage

RC / L / /

ProvinceOrState

New Jersey / Minnesota / /

Technology

Simulation / /

SocialTag