Back to Results
First PageMeta Content
Complexity classes / NP-complete / P versus NP problem / NP-hard / NP / Boolean satisfiability problem / P / Bounded-error probabilistic polynomial / NEXPTIME / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2007-05-24 22:16:31

Open Document

File Size: 150,28 KB

Share Result on Facebook

City

Paris / /

Company

IBM / NEC / Oracle / Vertex / Microsoft / /

Country

Brazil / /

/

Facility

Princeton University / University of Sao Paulo / University of Rochester / College Park / University of Illinois / Ohio University / University of Rochester Rochester / University of Chicago / Cornell University / University of Mass / University of Kentucky / University of Waterloo / University of Memphis / Appalachian State University / University of South Carolina / University of Massachusetts / Tufts University / University of Texas / University of Maryland / University of North Texas / BAR Conjecture / University of Wisconsin / San Jose State University / /

IndustryTerm

clever algorithm / mathematical tools / machinery / polynomial time solution / approximation algorithms / polynomial-time algorithms / positive solution / stronger and stronger systems / computing / /

NaturalFeature

David Isles / /

Organization

University of Massachusetts / University of Mass / University of South Carolina / National Science Foundation / University of Maryland / Ohio University / University of North Texas / University of Rochester Rochester / Princeton University / University of Waterloo / Tufts University / University of Maryland / College Park / University of Rochester / Cornell University / Department of Computer Sciences / Univ of MD Balt County / University of Illinois / Appalachian State University / University of Chicago / University of Sao Paulo / Sao Paulo / University of Kentucky / San Jose State University / University of Texas at El Paso / University of Memphis / University of Wisconsin / Stanford / /

Person

Dana Nau / Karl Papadantonakis / Eric Bach / Ian Parberry / Chris Umans / Marcus Schaeffer / Jim Owings / Lance Fortnow / Richard Karp / Francisco Antonio Doria / John Kadvany / Chris Pollett / Jamie Andrews / Mitsu Ogihara / Donald Knuth / William I. Gasarch / Bill Gasarch / Jeff Hirst / Andy Klapper / Bela Bollobas / Anil Nerode / David Juedes / Sam Buss / Robin Hartshorne / Ron Fagin / Juris Hartmanis / Ming Li / Harvey Friedman / Ketan Mulmuley / Stuart Kurtz / Richard Chang / Stephan Fenner / Yuri Gurevich / Laszlo Lovasz / David Barrington / John Conway / Tim Gowers / Clyde Kruskal / Charles Read / Neil Immerman / Lane A. Hemaspaandra / telling Sam Buss / /

Position

young researcher / mathematician / standard model for arithmetics / Major / poor assistant professor / vs VP / /

ProvinceOrState

Texas / Kentucky / Wisconsin / Maryland / Illinois / South Carolina / Balt County / Massachusetts / /

Region

North Texas / /

Technology

polynomial-time algorithms / time algorithm / approximation algorithms / /

URL

http /

SocialTag