Back to Results
First PageMeta Content
Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Matching / Probabilistic method / Petersen graph / Robertson–Seymour theorem / Graph coloring / Graph theory / Mathematics / Theoretical computer science


The Computational Complexity Column by Lance FORTNOW NEC Research Institute
Add to Reading List

Document Date: 2001-01-24 15:44:35


Open Document

File Size: 263,45 KB

Share Result on Facebook

City

Princeton / Chicago / Florence / /

Country

United States / /

/

Facility

Institute of Advanced Studies / College Park / University of MD. / Lance FORTNOW NEC Research Institute / /

IndustryTerm

parallel algorithms / p-processor algorithm / randomized algorithm / polynomial time algorithm / nonconstructive algorithm / rst k-round sorting algorithm / constructive algorithm / parallel sorting algorithms / constant-time parallel sorting algorithms / subquadratic sorting algorithm / /

Organization

Lance FORTNOW NEC Research Institute / National Science Foundation / Institute of Advanced Studies / University of MD. / /

Person

Luca Trevisan / William Gasarch Evan Golub / Russell Impagliazzo / Salil Vadhan / Paul Beame / Evan Golub / Sanjeev Arora / Oded Goldreich / Ran Raz / Steven Rudich / Michael Ben-Or / /

/

ProvinceOrState

New Jersey / Maryland / /

Technology

nonconstructive algorithm / randomized algorithm / sorting algorithm / polynomial time algorithm / interesting constant-time parallel sorting algorithms / Nonconstructive Algorithm The rst k-round sorting algorithm / constructive algorithm / The algorithm / parallel sorting algorithms / constructive 2-round subquadratic sorting algorithm / value ALGORITHM / p-processor algorithm / /

URL

http /

SocialTag