Back to Results
First PageMeta Content
Computational complexity theory / Interpolation / P versus NP problem / Time complexity / Mathematical optimization / Complexity / NP / Minimum description length / Algorithm / Theoretical computer science / Applied mathematics / Mathematics


Document Date: 2007-11-01 07:43:17

Open Document

File Size: 228,49 KB

Share Result on Facebook

City

Sankt Augustin / /

Country

Germany / /

Facility

worldsHeinz Muhlenbein German National Research Center / /

IndustryTerm

energy levels / polynomial time algorithms / exponential time algorithms / information processing / learning systems / research / inequality device / information search spaces / arti cial systems / simpli cation algorithm / approximamal algorithms / unknown solution / computing / molecular electronics / huge processing capabilities / cial learning systems / search space / particular algorithm / energy / /

Movie

The only thing / /

NaturalFeature

Shannon / /

Organization

worldsHeinz Muhlenbein German National Research Center for Computer Science / ded / /

Person

John von Neumann / Heinz Muhlenbein Hi / /

Position

butcher / model / researcher / one of the founders / salesman / programmer / /

ProgrammingLanguage

C / Occam / /

Technology

simpli cation algorithm / particular algorithm / thermodynamics / resulting algorithm / exponential time algorithms / approximamal algorithms / polynomial time algorithms / /

SocialTag