Computer Science and Engineering Department Seminar
CS655 Independent Study Presentation

Friday March 14th 2008, 10:30-11am
Place: JBH359
Presenter: Nabeel Zahrani
Topic: Parallel Computation
Advisor: Dr. Karant

Contents
	Theory of P-completeness 
	Parallel Computation Models
	Classes NC and P
	Reducibility
	Completeness
	Fundamental P-complete problems
	Why NC # P?
	Primary P-complete problem
	Sequential Computational Models and their parallel versions
	Classifying algorithms as inherently sequential
	Practical Parallel Computation