Computer Science and Engineering, UCSD
CSE 200: Computability and Complexity
Problem Set 1
Winter 11
Instructor: Mihir Bellare
January 5, 2011
Problem Set 1
Due: Wednesday January 12, 2011, in class.
CSE200: Computability and complexity
Homework set 2 solution
Shachar Lovett
1
Primality in NP
To prove that a number n is prime, the proof is composed of:
r
i=1 qi .
1. Numbers q1 , . . . , qr such th
CSE200: Computability and complexity
Homework set 1 solution
Shachar Lovett
1
Single tape Turing machine
We need to prove that the standard 3-tape Turing machine (with separate tapes for input,
work a
CSE200: Computability and complexity
Homework set 3
Shachar Lovett
Due by May 29 (hand in class)
1
Schning algorithm for 3SAT
o
We will analyze Schnings randomized algorithm for 3SAT [Sch99]. Let us r
CSE 200 Computability and Complexity
Wednesday, April 3, 2013
Lecture 2: Uncomputability and the Haling Problem
Instructor: Professor Shachar Lovett
1
Scribe: Dongcai Shen
The Universal Turing Machine
CSE 200 Computability and Complexity
Monday, May 20, 2013
Lecture 15: Randomized Computation (cont.)
Instructor: Professor Shachar Lovett
1
Scribe: Dongcai Shen
Random Walk Algorithms for k-SAT
1.1
A
CSE 200 Computability and Complexity
Monday, April 22, 2013
Lecture 7: Space Complexity
Instructor: Professor Shachar Lovett
1
Scribe: Dongcai Shen
LOGSPACE Reduction L
This week we will talk about sp
CSE200: Computability and complexity
Homework set 2
Shachar Lovett
Due by May 13th (hand in class)
1
Primality in NP
Let PRIMES be set of prime numbers. It is easy to see that P RIM ES coN P since
a c
CSE200: Computability and complexity
Final Exam
Shachar Lovett
Due by June 14th
The nal take-home exam is individual. You are not allowed to consult with any other
students or any other person for tha
Computer Science and Engineering, UCSD
CSE 200: Computability and Complexity
Final Exam Solutions
Winter 11
Instructor: Mihir Bellare
March 16, 2011
Final Exam Solutions
We x the alphabet = cfw_0, 1.
Computer Science and Engineering, UCSD
CSE 200: Computability and Complexity
Problem Set 6 Solutions
Winter 11
Instructor: Mihir Bellare
March 9, 2011
Problem Set 6 Solutions
In all problems the langu
Computer Science and Engineering, UCSD
CSE 200: Computability and Complexity
Problem Set 5 Solutions
Winter 11
Instructor: Mihir Bellare
February 23, 2011
Problem Set 5 Solutions
In all problems the l
Computer Science and Engineering, UCSD
CSE 200: Computability and Complexity
Course Information
Winter 10
Instructor: Mihir Bellare
January 3, 2010
Course Information
Meets: M and W, 9:30AM10:50AM in
Computer Science and Engineering, UCSD
CSE 200: Computability and Complexity
Decision versus Search
Winter 10
Instructor: Mihir Bellare
January 3, 2010
Decision versus Search
When we want to solve a p
Computer Science and Engineering, UCSD
CSE 200: Computability and Complexity
Computability Crib Sheet
Winter 10
Instructor: Mihir Bellare
January 3, 2010
Computability Crib Sheet
This is a quick refer
Computer Science and Engineering, UCSD
CSE 200: Computability and Complexity
An example of a NP-completeness proof
Winter 11
Instructor: Mihir Bellare
January 3, 2011
An example of a NP-completeness p