Back to Results
First PageMeta Content
Complexity classes / Mathematical optimization / Structural complexity theory / NP-complete / Polynomial-time reduction / P versus NP problem / NP / P-complete / Probabilistically checkable proof / Theoretical computer science / Computational complexity theory / Applied mathematics


Introduction to Complexity Theory { Lecture Notes Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Email: [removed] July 31, 1999
Add to Reading List

Document Date: 2000-12-12 06:50:00


Open Document

File Size: 2,33 MB

Share Result on Facebook

City

New York / /

Company

PWS Publishing Company / /

Country

Israel / /

/

Facility

Weizmann Institute of Science / Applied Mathematics Weizmann Institute of Science / /

IndustryTerm

search vs decision / proof systems / search problems / search algorithms / /

Organization

Oded Goldreich Department of Computer Science / Weizmann Institute of Science / /

Person

Oded Lachish / Avi Wigderson / Yoav Rodeh / Guy Peer / Dana Ron / Yael Tauman / Tamar Seeman / Ruediger Reischuk / Noam Sadot / Nir Piterman / Ronen Mizrahi / Dana Fisman / Erez Waisbard / Moshe Lewenstein / Leia Passoni / Alon Rosen / Paul Beame / Gera Weiss / Tal Hassner / Michael Elkin / Danny Harnik / Oded Goldreich / Ekaterina Sedletsky / Ran Raz / Reuben Sumner / Sergey Benditkis / Boris Temkin / Amiel Ferman / /

Position

teacher / /

ProvinceOrState

New York / /

PublishedMedium

Theoretical Computer Science / /

Technology

Cryptography / search algorithms / /

SocialTag