**[course_title]** course covers the basic elements of theoretical computer science covering NP-completeness.

At first, the course provides an extensive discussion on the tough problems and their analysis which will be followed by the techniques to solve the tough algorithmic problems. Finally, the problems that cannot be solved by computer will be discussed in the course.

Upon completion, you will know the most challenging algorithmic problems and the tools to deal with them.

**Assessment**

This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer need to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.

**Certification**

Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.

Having an Official Edukite Certification is a great way to celebrate and share your success. You can:

- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success

Course Credit: Udacity

### Course Curriculum

1. Introduction – Intro to Theoretical Computer Science | 00:01:00 | ||

2. Challenging Problems… – Intro to Theoretical Computer Science | 00:01:00 | ||

3. And What To Do About Them – Intro to Theoretical Computer Science | 00:02:00 | ||

4. Recognize Understand Navigate – Intro to Theoretical Computer Science | 00:01:00 | ||

5. Computability Or Complexity Theory – Intro to Theoretical Computer Science | 00:01:00 | ||

6. Computability Or Complexity Theory Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

7. Overview – Intro to Theoretical Computer Science | 00:01:00 | ||

8. Alice, Bob And Carol – Intro to Theoretical Computer Science | 00:01:00 | ||

9. Alice’s Problem – Intro to Theoretical Computer Science | 00:02:00 | ||

10. Network Monitoring – Intro to Theoretical Computer Science | 00:01:00 | ||

11. Network Monitoring Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

12. cs313 unit11 10 q Installing Monitoring Devices | 00:04:00 | ||

13. Installing Monitoring Devices Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

14. Alice’s Algorithm – Intro to Theoretical Computer Science | 00:02:00 | ||

15. How Many Loops – Intro to Theoretical Computer Science | 00:01:00 | ||

16. How Many Loops Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

17. Twenty Communication Centers – Intro to Theoretical Computer Science | 00:01:00 | ||

18. Twenty Communication Centers Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

19. Five Hundred Communication Centers – Intro to Theoretical Computer Science | 00:01:00 | ||

20. Five Hundred Communication Centers Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

21. Problems And Algorithms – Intro to Theoretical Computer Science | 00:03:00 | ||

22. Analyzing Algorithms – Intro to Theoretical Computer Science | 00:02:00 | ||

23. Analyzing Algorithms Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

24. Simplifications – Intro to Theoretical Computer Science | 00:02:00 | ||

25. The Ram – Intro to Theoretical Computer Science | 00:02:00 | ||

26. The Ram Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

27. Random Access Machine – Intro to Theoretical Computer Science | 00:03:00 | ||

28. Number Of Timesteps – Intro to Theoretical Computer Science | 00:01:00 | ||

29. Number Of Timesteps Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

30. Number Of Timesteps 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

31. Number Of Timesteps 2 Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

32. Simplifications For Ram – Intro to Theoretical Computer Science | 00:02:00 | ||

33. Simplifications For Ram Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

34. Running Time Vs Structure – Intro to Theoretical Computer Science | 00:03:00 | ||

35. Running Time Vs Structure Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

36. Best Worst Average Input – Intro to Theoretical Computer Science | 00:02:00 | ||

37. Best And Worst Running Times – Intro to Theoretical Computer Science | 00:01:00 | ||

38. Best And Worst Running Times Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

39. Which Type Of Analysis – Intro to Theoretical Computer Science | 00:03:00 | ||

40. Best And Worst Case Inputs – Intro to Theoretical Computer Science | 00:02:00 | ||

41. Best And Worst Case Inputs Solution – Intro to Theoretical Computer Science | 00:05:00 | ||

42. Big O Notation – Intro to Theoretical Computer Science | 00:02:00 | ||

43. Big O Notation Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

44. Removing What’s Unimportant – Intro to Theoretical Computer Science | 00:01:00 | ||

45. Definition Of Big O Notation – Intro to Theoretical Computer Science | 00:03:00 | ||

46. Comparing Growth Rates – Intro to Theoretical Computer Science | 00:02:00 | ||

47. Comparing Growth Rates Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

48. Examples Of O Notation – Intro to Theoretical Computer Science | 00:03:00 | ||

49. Recognizing Bounds – Intro to Theoretical Computer Science | 00:01:00 | ||

50. Recognizing Bounds – Intro to Theoretical Computer Science | 00:03:00 | ||

51. Landau Notation – Intro to Theoretical Computer Science | 00:01:00 | ||

52. Running Time Using Big O Notation – Intro to Theoretical Computer Science | 00:03:00 | ||

53. Running Time Quiz – Intro to Theoretical Computer Science | 00:02:00 | ||

54. Running Time Quiz Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

55. Analyzing Alice’s Algorithm – Intro to Theoretical Computer Science | 00:06:00 | ||

56. Analyzing Alice’s Algorithm – Intro to Theoretical Computer Science | 00:02:00 | ||

57. Acceptable And Unacceptable Running Times – Intro to Theoretical Computer Science | 00:02:00 | ||

58. Polynomial Or Exponential Running Time – Intro to Theoretical Computer Science | 00:01:00 | ||

59. Polynomial Or Exponential Running Time Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

60. Bob’s Problem – Intro to Theoretical Computer Science | 00:03:00 | ||

61. Genetics Network – Intro to Theoretical Computer Science | 00:01:00 | ||

62. Genetics Network Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

63. Bob’s Algorithm – Intro to Theoretical Computer Science | 00:03:00 | ||

64. Bob’s Algorithm – Intro to Theoretical Computer Science | 00:01:00 | ||

65. Tractable And Intractable Problems – Intro to Theoretical Computer Science | 00:02:00 | ||

66. Tractable And Intractable Problems Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

67. Showing Tractability And Intractability – Intro to Theoretical Computer Science | 00:01:00 | ||

68. Showing Tractability And Intractability Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

69. Tractable Vs Intractable – Intro to Theoretical Computer Science | 00:02:00 | ||

70. Carol’s Problem – Intro to Theoretical Computer Science | 00:03:00 | ||

71. Carol’s Problem – Intro to Theoretical Computer Science | 00:02:00 | ||

72. Bob And Carol Meet – Intro to Theoretical Computer Science | 00:05:00 | ||

73. Clique – Intro to Theoretical Computer Science | 00:01:00 | ||

74. Clique Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

75. Independent Set – Intro to Theoretical Computer Science | 00:01:00 | ||

76. Independent Set Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

77. Good News For Bob And Carol – Intro to Theoretical Computer Science | 00:03:00 | ||

78. Enter Alice – Intro to Theoretical Computer Science | 00:02:00 | ||

79. Vertex Cover – Intro to Theoretical Computer Science | 00:01:00 | ||

80. Vertex Cover Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

81. Reductions – Intro to Theoretical Computer Science | 00:03:00 | ||

82. Congratulations – Intro to Theoretical Computer Science | 00:01:00 | ||

83. Running Time – Intro to Theoretical Computer Science | 00:03:00 | ||

84. Running Time Solution – Intro to Theoretical Computer Science | 00:04:00 | ||

85. Running Time 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

86. Running Time 2 Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

87. Careful Oh – Intro to Theoretical Computer Science | 00:03:00 | ||

88. Careful Oh Solution – Intro to Theoretical Computer Science | 00:04:00 | ||

89. Zero One Graph – Intro to Theoretical Computer Science | 00:03:00 | ||

90. Zero One Graph Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

91. shparG gnitrevnI – Intro to Theoretical Computer Science | 00:02:00 | ||

92. shparG gnitrevnI – Intro to Theoretical Computer Science | 00:01:00 | ||

93. Naivete Implemented – Intro to Theoretical Computer Science | 00:02:00 | ||

94. Naivete Implemented Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

95. Getting Organized – Intro to Theoretical Computer Science | 00:03:00 | ||

96. Getting Organized Solution – Intro to Theoretical Computer Science | 00:04:00 | ||

97. Which Problem Is Which – Intro to Theoretical Computer Science | 00:03:00 | ||

98. Which Problem Is Which Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

99. P Vs NP – Intro to Theoretical Computer Science | 00:02:00 | ||

100. Decision Problems – Intro to Theoretical Computer Science | 00:03:00 | ||

101. Decision Problems Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

102. How To Show Intractability – Intro to Theoretical Computer Science | 00:02:00 | ||

103. How To Show Intractability Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

104. Many Solutions Vs Intractability – Intro to Theoretical Computer Science | 00:02:00 | ||

105. Many Solutions Vs Intractability Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

106. Number Of Paths – Intro to Theoretical Computer Science | 00:01:00 | ||

107. Number Of Paths Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

108. Number Of Paths Continued – Intro to Theoretical Computer Science | 00:01:00 | ||

109. Number Of Paths Continued Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

110. Number Of Paths Generalizing – Intro to Theoretical Computer Science | 00:01:00 | ||

111. Number Of Paths Generalizing Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

112. Hardness Of Shortest Path – Intro to Theoretical Computer Science | 00:03:00 | ||

113. Gathering Evidence – Intro to Theoretical Computer Science | 00:04:00 | ||

114. Gathering Evidence Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

115. if-better – Intro to Theoretical Computer Science | 00:03:00 | ||

116. Vertex Cover With if-better – Intro to Theoretical Computer Science | 00:02:00 | ||

117. Vertex Cover With if-better – Intro to Theoretical Computer Science | 00:01:00 | ||

118. Complexity Classes – Intro to Theoretical Computer Science | 00:02:00 | ||

119. Complexity Classes Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

120. Two Types Of RAM – Intro to Theoretical Computer Science | 00:03:00 | ||

121. Two Types Of RAM – Intro to Theoretical Computer Science | 00:01:00 | ||

122. Building A Non-Deterministic Ram – Intro to Theoretical Computer Science | 00:05:00 | ||

123. Building A Non-Deterministic Ram – Intro to Theoretical Computer Science | 00:02:00 | ||

124. Simulating A Non-Deterministic Ram – Intro to Theoretical Computer Science | 00:03:00 | ||

125. Simulating A Non-Deterministic Ram – Intro to Theoretical Computer Science | 00:02:00 | ||

126. Polynomial Time – Intro to Theoretical Computer Science | 00:03:00 | ||

127. Polynomial Time Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

128. In P Or NP – Intro to Theoretical Computer Science | 00:02:00 | ||

129. In P Or NP – Intro to Theoretical Computer Science | 00:01:00 | ||

130. All In P Or NP – Intro to Theoretical Computer Science | 00:03:00 | ||

131. Polynomial Time Reduction – Intro to Theoretical Computer Science | 00:02:00 | ||

132. Polynomial Time Reduction Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

133. The Ultimate Problem In NP – Intro to Theoretical Computer Science | 00:02:00 | ||

134. The Ultimate Problem In NP – Intro to Theoretical Computer Science | 00:02:00 | ||

135. Proving NP-Completeness – Intro to Theoretical Computer Science | 00:02:00 | ||

136. Proving NP-Completeness – Intro to Theoretical Computer Science | 00:02:00 | ||

137. Seed Problem – Intro to Theoretical Computer Science | 00:01:00 | ||

138. Seed Problem – Intro to Theoretical Computer Science | 00:02:00 | ||

139. Boolean Satisfiability Problem – Intro to Theoretical Computer Science | 00:05:00 | ||

140. Boolean Satisfiability Problem Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

141. SAT – Intro to Theoretical Computer Science | 00:04:00 | ||

142. SAT – Intro to Theoretical Computer Science | 00:02:00 | ||

143. One More Detail – Intro to Theoretical Computer Science | 00:01:00 | ||

144. One More Detail Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

145. Cook Levin Theorem – Intro to Theoretical Computer Science | 00:03:00 | ||

146. Algorithms To Boolean Formulae – Intro to Theoretical Computer Science | 00:04:00 | ||

147. Algorithms To Boolean Formulae Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

148. Special Boolean Formula – Intro to Theoretical Computer Science | 00:02:00 | ||

149. Special Boolean Formula Solution – Intro to Theoretical Computer Science | 00:04:00 | ||

150. Snapshots – Intro to Theoretical Computer Science | 00:06:00 | ||

151. Properties Of Boolean Formula – Intro to Theoretical Computer Science | 00:02:00 | ||

152. Properties Of Boolean Formula Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

153. A Series Of Snapshots – Intro to Theoretical Computer Science | 00:03:00 | ||

154. Building A Boolean Formula – Intro to Theoretical Computer Science | 00:02:00 | ||

155. Connecting Snapshots – Intro to Theoretical Computer Science | 00:03:00 | ||

156. Connecting Snapshots Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

157. Rules – Intro to Theoretical Computer Science | 00:02:00 | ||

158. Behavior – Intro to Theoretical Computer Science | 00:02:00 | ||

159. Behavior Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

160. If Better Step – Intro to Theoretical Computer Science | 00:01:00 | ||

161. Putting It All Together – Intro to Theoretical Computer Science | 00:05:00 | ||

162. Putting It All Together Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

163. Congratulations – Intro to Theoretical Computer Science | 00:01:00 | ||

164. Seed Problem – Intro to Theoretical Computer Science | 00:02:00 | ||

165. Seed Problem Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

166. Only Solvable In Exponential Time – Intro to Theoretical Computer Science | 00:01:00 | ||

167. Only Solvable In Exponential Time – Intro to Theoretical Computer Science | 00:02:00 | ||

168. What Does This Mean For Alice, Bob & Carol? – Intro to Theoretical Computer Science | 00:02:00 | ||

169. Reducing SAT To Clique – Intro to Theoretical Computer Science | 00:02:00 | ||

170. Construction – Intro to Theoretical Computer Science | 00:05:00 | ||

171. Construction Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

172. Using Clique To Set Variables – Intro to Theoretical Computer Science | 00:03:00 | ||

173. Using Clique To Set Variables Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

174. More On P Vs NP – Intro to Theoretical Computer Science | 00:05:00 | ||

175. More On P Vs NP – Intro to Theoretical Computer Science | 00:03:00 | ||

176. Millenium Problem – Intro to Theoretical Computer Science | 00:03:00 | ||

177. Should You Try To Solve P Vs NP? – Intro to Theoretical Computer Science | 00:03:00 | ||

178. Should You Try To Solve P Vs NP? – Intro to Theoretical Computer Science | 00:01:00 | ||

179. Does The Story End Here? – Intro to Theoretical Computer Science | 00:01:00 | ||

180. Really – Intro to Theoretical Computer Science | 00:01:00 | ||

181. Really Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

182. Simulation Cost – Intro to Theoretical Computer Science | 00:02:00 | ||

183. Simulation Cost Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

184. Satisfaction Guaranteed – Intro to Theoretical Computer Science | 00:02:00 | ||

185. Satisfaction Guaranteed Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

186. Satisfied – Intro to Theoretical Computer Science | 00:03:00 | ||

187. Satisfied Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

188. P Vs NP – Intro to Theoretical Computer Science | 00:02:00 | ||

189. P Vs NP – Intro to Theoretical Computer Science | 00:03:00 | ||

190. Introduction – Intro to Theoretical Computer Science | 00:01:00 | ||

191. Detecting NP Completeness – Intro to Theoretical Computer Science | 00:01:00 | ||

192. What To Do – Intro to Theoretical Computer Science | 00:01:00 | ||

193. What To Do Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

194. Finding A Reduction – Intro to Theoretical Computer Science | 00:02:00 | ||

195. Finding A Reduction Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

196. Optimizing Delivery Routes – Intro to Theoretical Computer Science | 00:02:00 | ||

197. Optimizing Delivery Routes Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

198. Shortest Tour – Intro to Theoretical Computer Science | 00:02:00 | ||

199. Shortest Tour Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

200. Showing NP Completeness – Intro to Theoretical Computer Science | 00:02:00 | ||

201. Showing NP Completeness – Intro to Theoretical Computer Science | 00:01:00 | ||

202. Step 1 – Intro to Theoretical Computer Science | 00:01:00 | ||

203. Step 1 Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

204. Step 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

205. Step 2 Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

206. Reducing SAT To Shortest Tour – Intro to Theoretical Computer Science | 00:05:00 | ||

207. Reducing SAT To Shortest Tour – Intro to Theoretical Computer Science | 00:03:00 | ||

208. Shortest Path Example – Intro to Theoretical Computer Science | 00:01:00 | ||

209. Shortest Path Example Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

210. Number Of Paths – Intro to Theoretical Computer Science | 00:01:00 | ||

211. Number Of Paths Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

212. Second Path Example – Intro to Theoretical Computer Science | 00:01:00 | ||

213. Second Path Example Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

214. Final Path Example – Intro to Theoretical Computer Science | 00:01:00 | ||

215. Final Path Example Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

216. Combining Structures – Intro to Theoretical Computer Science | 00:01:00 | ||

217. Combining Structures Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

218. Connecting Paths And Boolean Formulas – Intro to Theoretical Computer Science | 00:02:00 | ||

219. Connecting Paths And Boolean Formulas Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

220. Representing True And False Variables – Intro to Theoretical Computer Science | 00:02:00 | ||

221. Representing True And False Variables Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

222. Number Of Vertices For Variables – Intro to Theoretical Computer Science | 00:03:00 | ||

223. Number Of Vertices For Variables Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

224. Number Of Vertices For Clauses – Intro to Theoretical Computer Science | 00:01:00 | ||

225. Number Of Vertices For Clauses Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

226. Length Of Shortest Path – Intro to Theoretical Computer Science | 00:01:00 | ||

227. Length Of Shortest Path Solution – Intro to Theoretical Computer Science | 00:05:00 | ||

228. A Library Of NP-Completeness – Intro to Theoretical Computer Science | 00:03:00 | ||

229. A Library Of NP-Completeness – Intro to Theoretical Computer Science | 00:02:00 | ||

230. More NP-Complete Problems – Intro to Theoretical Computer Science | 00:04:00 | ||

231. More NP-Complete Problems – Intro to Theoretical Computer Science | 00:01:00 | ||

232. Practical Scenarios – Intro to Theoretical Computer Science | 00:03:00 | ||

233. Practical Scenarios Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

234. Other Sources Of NP-Complete Problems – Intro to Theoretical Computer Science | 00:01:00 | ||

235. Border Between NP-Complete And P – Intro to Theoretical Computer Science | 00:03:00 | ||

236. Border Between NP-Complete And P – Intro to Theoretical Computer Science | 00:01:00 | ||

237. Coloring Cliques – Intro to Theoretical Computer Science | 00:02:00 | ||

238. Coloring Cliques Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

239. Many Vans – Intro to Theoretical Computer Science | 00:02:00 | ||

240. Many Vans Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

241. Many Vans 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

242. Many Vans 2 Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

243. Just Once – Intro to Theoretical Computer Science | 00:02:00 | ||

244. Just Once Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

245. Just Once 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

246. Just Once 2 Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

247. Four Coloring – Intro to Theoretical Computer Science | 00:02:00 | ||

248. Four Coloring Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

249. Introduction – Intro to Theoretical Computer Science | 00:01:00 | ||

250. Counter Measures – Intro to Theoretical Computer Science | 00:02:00 | ||

251. Counter Measures Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

252. Laws Of NP-Completeness – Intro to Theoretical Computer Science | 00:02:00 | ||

253. Ten Times Faster – Intro to Theoretical Computer Science | 00:02:00 | ||

254. Ten Times Faster Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

255. Hundred Times Faster – Intro to Theoretical Computer Science | 00:01:00 | ||

256. Hundred Times Faster Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

257. Brute Force – Intro to Theoretical Computer Science | 00:03:00 | ||

258. Brute Force – Intro to Theoretical Computer Science | 00:02:00 | ||

259. Number Of Instances – Intro to Theoretical Computer Science | 00:01:00 | ||

260. Number Of Instances Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

261. Loophole 1 – Intro to Theoretical Computer Science | 00:02:00 | ||

262. Loophole 1 – Intro to Theoretical Computer Science | 00:01:00 | ||

263. Loophole 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

264. Loophole 2 Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

265. Brute Force On Vertex Cover – Intro to Theoretical Computer Science | 00:03:00 | ||

266. Search Tree – Intro to Theoretical Computer Science | 00:04:00 | ||

267. Improving The Search Tree – Intro to Theoretical Computer Science | 00:03:00 | ||

268. Properties Of Search Tree Construction – Intro to Theoretical Computer Science | 00:02:00 | ||

269. Properties Of Search Tree Construction Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

270. Smart Search Tree – Intro to Theoretical Computer Science | 00:03:00 | ||

271. Smart Search Tree Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

272. 2^N Or 3^(N/2) – Intro to Theoretical Computer Science | 00:01:00 | ||

273. 2^N Or 3^(N/2) – Intro to Theoretical Computer Science | 00:01:00 | ||

274. Speed Up – Intro to Theoretical Computer Science | 00:03:00 | ||

275. Helping Bob And Carol – Intro to Theoretical Computer Science | 00:02:00 | ||

276. Search Tree For Independent Set – Intro to Theoretical Computer Science | 00:01:00 | ||

277. Search Tree For Independent Set Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

278. One Vertex In – Intro to Theoretical Computer Science | 00:01:00 | ||

279. One Vertex In Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

280. How Low Can You Go – Intro to Theoretical Computer Science | 00:03:00 | ||

281. Max Problem Size – Intro to Theoretical Computer Science | 00:01:00 | ||

282. Max Problem Size Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

283. Worst Case Vs Reality – Intro to Theoretical Computer Science | 00:02:00 | ||

284. Preprocessing – Intro to Theoretical Computer Science | 00:04:00 | ||

285. Preprocessing Solution – Intro to Theoretical Computer Science | 00:04:00 | ||

286. Preprocessing For SAT – Intro to Theoretical Computer Science | 00:01:00 | ||

287. Preprocessing For SAT – Intro to Theoretical Computer Science | 00:02:00 | ||

288. Requirements For Preprocessing – Intro to Theoretical Computer Science | 00:02:00 | ||

289. Requirements For Preprocessing Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

290. Preprocessing For Vertex Cover – Intro to Theoretical Computer Science | 00:02:00 | ||

291. Preprocessing For Vertex Cover Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

292. Improving The Search Tree – Intro to Theoretical Computer Science | 00:02:00 | ||

293. Search Tree Branches – Intro to Theoretical Computer Science | 00:01:00 | ||

294. Search Tree Branches Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

295. Size Of Search Tree – Intro to Theoretical Computer Science | 00:01:00 | ||

296. Size Of Search Tree Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

297. When To Apply Preprocessing – Intro to Theoretical Computer Science | 00:01:00 | ||

298. When To Apply Preprocessing Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

299. Size Of Input – Intro to Theoretical Computer Science | 00:02:00 | ||

300. Size Of Input – Intro to Theoretical Computer Science | 00:01:00 | ||

301. Hardness – Intro to Theoretical Computer Science | 00:02:00 | ||

302. Measuring The Hardness Of Vertex Cover – Intro to Theoretical Computer Science | 00:02:00 | ||

303. Measuring The Hardness Of Vertex Cover Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

304. Decision Version Of Vertex Cover – Intro to Theoretical Computer Science | 00:01:00 | ||

305. Decision Version Of Vertex Cover Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

306. Number Of Assignments – Intro to Theoretical Computer Science | 00:01:00 | ||

307. Number Of Assignments Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

308. Search Tree Size – Intro to Theoretical Computer Science | 00:02:00 | ||

309. Time To Solve Decision Version – Intro to Theoretical Computer Science | 00:01:00 | ||

310. Time To Solve Decision Version Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

311. Fixed Parameter Tractability – Intro to Theoretical Computer Science | 00:04:00 | ||

312. FPT Vertex Cover Clique Independent Set Shortest Tour – Intro to Theoretical Computer Science | 00:02:00 | ||

313. Shortest Tour – Intro to Theoretical Computer Science | 00:01:00 | ||

314. Shortest Tour Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

315. Closest To 2-SAT – Intro to Theoretical Computer Science | 00:02:00 | ||

316. Closest To 2-SAT – Intro to Theoretical Computer Science | 00:02:00 | ||

317. State Of The Art – Intro to Theoretical Computer Science | 00:04:00 | ||

318. Conclusion – Intro to Theoretical Computer Science | 00:02:00 | ||

319. The Size Of A Tree – Intro to Theoretical Computer Science | 00:02:00 | ||

320. The Size Of A Tree Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

321. Cover By Tree – Intro to Theoretical Computer Science | 00:01:00 | ||

322. Cover By Tree Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

323. A Better Tree – Intro to Theoretical Computer Science | 00:02:00 | ||

324. A Better Tree Solution – Intro to Theoretical Computer Science | 00:04:00 | ||

325. Reduced Satisfaction – Intro to Theoretical Computer Science | 00:03:00 | ||

326. Reduced Satisfaction Solution – Intro to Theoretical Computer Science | 00:05:00 | ||

327. Reduction Power – Intro to Theoretical Computer Science | 00:02:00 | ||

328. Reduction Power Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

329. Reduction Power 2 – Intro to Theoretical Computer Science | 00:02:00 | ||

330. Reduction Power 2 Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

331. Introduction – Intro to Theoretical Computer Science | 00:01:00 | ||

332. Sloppiness – Intro to Theoretical Computer Science | 00:03:00 | ||

333. Sloppiness Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

334. Approximation Quality – Intro to Theoretical Computer Science | 00:02:00 | ||

335. Approximation Quality Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

336. Factor 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

337. Factor 2 Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

338. Polynomial Time Approximation Schemes – Intro to Theoretical Computer Science | 00:03:00 | ||

339. Polynomial Time Approximation Schemes Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

340. Size Of Vertex Cover – Intro to Theoretical Computer Science | 00:01:00 | ||

341. Size Of Vertex Cover Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

342. Take 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

343. Take 2 Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

344. Take 2 Running Time – Intro to Theoretical Computer Science | 00:01:00 | ||

345. Take 2 Running Time Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

346. Take 2 Approximation Quality – Intro to Theoretical Computer Science | 00:01:00 | ||

347. Take 2 Approximation Quality Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

348. Greedy – Intro to Theoretical Computer Science | 00:01:00 | ||

349. Greedy Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

350. Tricking Greedy – Intro to Theoretical Computer Science | 00:02:00 | ||

351. Tricking Greedy Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

352. Tricking Greedy Part 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

353. Tricking Greedy Part 2 Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

354. Minimum Cover – Intro to Theoretical Computer Science | 00:05:00 | ||

355. Minimum Cover Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

356. Greedy’s Cover – Intro to Theoretical Computer Science | 00:01:00 | ||

357. Greedy’s Cover – Intro to Theoretical Computer Science | 00:01:00 | ||

358. Greedy Approximation Factor – Intro to Theoretical Computer Science | 00:01:00 | ||

359. Greedy Approximation Factor Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

360. What To Do In Practice – Intro to Theoretical Computer Science | 00:01:00 | ||

361. What To Do In Practice Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

362. Dave’s Problem – Intro to Theoretical Computer Science | 00:03:00 | ||

363. Dave’s Problem – Intro to Theoretical Computer Science | 00:01:00 | ||

364. Minimum Spanning Tree – Intro to Theoretical Computer Science | 00:02:00 | ||

365. Finding A Minimum Spanning Tree – Intro to Theoretical Computer Science | 00:01:00 | ||

366. Finding A Minimum Spanning Tree Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

367. Walk Along A Tree – Intro to Theoretical Computer Science | 00:01:00 | ||

368. Algorithm For Shortest Tour – Intro to Theoretical Computer Science | 00:02:00 | ||

369. Algorithm For Shortest Tour Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

370. Weight Of Walk – Intro to Theoretical Computer Science | 00:01:00 | ||

371. Weight Of Walk Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

372. Shortest Tour And Mst Weight – Intro to Theoretical Computer Science | 00:01:00 | ||

373. Shortest Tour And Mst Weight Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

374. Algorithm Approximation Factor – Intro to Theoretical Computer Science | 00:02:00 | ||

375. Algorithm Approximation Factor Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

376. Carrying Over Algorithms – Intro to Theoretical Computer Science | 00:02:00 | ||

377. Carrying Over Algorithms Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

378. Reductions And Approximation Algorithms – Intro to Theoretical Computer Science | 00:03:00 | ||

379. Useful Approximation Factor – Intro to Theoretical Computer Science | 00:01:00 | ||

380. Useful Approximation Factor Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

381. Carrying Properties Over Reductions – Intro to Theoretical Computer Science | 00:02:00 | ||

382. Poor Bob And Carol – Intro to Theoretical Computer Science | 00:01:00 | ||

383. Guess A Word – Intro to Theoretical Computer Science | 00:01:00 | ||

384. Guess A Word Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

385. Guess A Word Given 2 Letters – Intro to Theoretical Computer Science | 00:01:00 | ||

386. Guess A Word Given 2 Letters Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

387. Knowing Part Of The Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

388. Travelling Salesman – Intro to Theoretical Computer Science | 00:01:00 | ||

389. Polynomial Time Approximation Scheme – Intro to Theoretical Computer Science | 00:03:00 | ||

390. Polynomial Time Approximation Scheme Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

391. Pseudopolynomial Algorithm For Knapsack – Intro to Theoretical Computer Science | 00:03:00 | ||

392. Pseudopolynomial Algorithm For Knapsack Solution – Intro to Theoretical Computer Science | 00:04:00 | ||

393. Knapsack Table – Intro to Theoretical Computer Science | 00:01:00 | ||

394. Knapsack Table Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

395. Time To Build The Table – Intro to Theoretical Computer Science | 00:01:00 | ||

396. Time To Build The Table Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

397. P = NP? – Intro to Theoretical Computer Science | 00:01:00 | ||

398. P = NP? – Intro to Theoretical Computer Science | 00:01:00 | ||

399. Divide By V – Intro to Theoretical Computer Science | 00:01:00 | ||

400. Divide By V Solution – Intro to Theoretical Computer Science | 00:04:00 | ||

401. Scaling The Values – Intro to Theoretical Computer Science | 00:02:00 | ||

402. Scaling The Values Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

403. Errors – Intro to Theoretical Computer Science | 00:01:00 | ||

404. Errors Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

405. Quantifying The Error – Intro to Theoretical Computer Science | 00:02:00 | ||

406. Quantifying The Error Solution – Intro to Theoretical Computer Science | 00:06:00 | ||

407. No Guarantees – Intro to Theoretical Computer Science | 00:02:00 | ||

408. No Guarantees Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

409. Greedy Implementation – Intro to Theoretical Computer Science | 00:01:00 | ||

410. Greedy Implementation Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

411. Greedy Or Not – Intro to Theoretical Computer Science | 00:01:00 | ||

412. Better Tours – Intro to Theoretical Computer Science | 00:03:00 | ||

413. Better Tours Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

414. Introduction – Intro to Theoretical Computer Science | 00:01:00 | ||

415. Poking Around – Intro to Theoretical Computer Science | 00:03:00 | ||

416. Poking Around Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

417. Monte Carlo Algorithm – Intro to Theoretical Computer Science | 00:01:00 | ||

418. Monte Carlo Algorithm Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

419. Guarantees – Intro to Theoretical Computer Science | 00:02:00 | ||

420. Guarantees Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

421. Chance | 00:01:00 | ||

422. Chance | 00:01:00 | ||

423. Last Round – Intro to Theoretical Computer Science | 00:02:00 | ||

424. Last Round Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

425. Using Randomized Algorithms – Intro to Theoretical Computer Science | 00:03:00 | ||

426. Needle In A Haystack – Intro to Theoretical Computer Science | 00:03:00 | ||

427. Needle In A Haystack Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

428. Strategy – Intro to Theoretical Computer Science | 00:03:00 | ||

429. Strategy Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

430. Wishlist – Intro to Theoretical Computer Science | 00:05:00 | ||

431. Success Factors – Intro to Theoretical Computer Science | 00:01:00 | ||

432. Success Factors Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

433. Success Factor Ii – Intro to Theoretical Computer Science | 00:01:00 | ||

434. Success Factor Ii Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

435. Distance To Satisfying Assignment – Intro to Theoretical Computer Science | 00:04:00 | ||

436. Distance To Satisfying Assignment Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

437. Expected Running Time – Intro to Theoretical Computer Science | 00:03:00 | ||

438. Expected Running Time Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

439. Big O – Intro to Theoretical Computer Science | 00:01:00 | ||

440. Big O Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

441. Evolution Of 3-SAT Algorithms – Intro to Theoretical Computer Science | 00:01:00 | ||

442. Evolution Of 3-SAT Algorithms – Intro to Theoretical Computer Science | 00:01:00 | ||

443. Randomization Is Better – Intro to Theoretical Computer Science | 00:01:00 | ||

444. Randomization Is Better Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

445. When To Use Randomization – Intro to Theoretical Computer Science | 00:01:00 | ||

446. When To Use Randomization Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

447. Randomization Vs Determinism – Intro to Theoretical Computer Science | 00:02:00 | ||

448. Randomization Vs Determinism Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

449. Dealing With NP-Completeness – Intro to Theoretical Computer Science | 00:02:00 | ||

450. What You Know – Intro to Theoretical Computer Science | 00:01:00 | ||

451. What You Know Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

452. What You Know – NP – Intro to Theoretical Computer Science | 00:01:00 | ||

453. What You Know – NP – Intro to Theoretical Computer Science | 00:02:00 | ||

454. Exptime And Nexptime – Intro to Theoretical Computer Science | 00:02:00 | ||

455. Exptime And Nexptime Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

456. EXPTIME = NEXPTIME? – Intro to Theoretical Computer Science | 00:01:00 | ||

457. EXPTIME = NEXPTIME? – Intro to Theoretical Computer Science | 00:01:00 | ||

458. Games – Intro to Theoretical Computer Science | 00:02:00 | ||

459. Roadblock – Intro to Theoretical Computer Science | 00:04:00 | ||

460. Roadblock Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

461. Time For Roadblock – Intro to Theoretical Computer Science | 00:04:00 | ||

462. Hierachies – Intro to Theoretical Computer Science | 00:02:00 | ||

463. Hierachies Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

464. Problems In NP – Intro to Theoretical Computer Science | 00:02:00 | ||

465. Problems In NP – Intro to Theoretical Computer Science | 00:01:00 | ||

466. The Complexity Zoo – Intro to Theoretical Computer Science | 00:02:00 | ||

467. Properties Of Our Problems – Intro to Theoretical Computer Science | 00:02:00 | ||

468. Properties Of Our Problems Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

469. Goodbye Alice, Bob, Carol And Dave – Intro to Theoretical Computer Science | 00:01:00 | ||

470. Random Touring – Intro to Theoretical Computer Science | 00:02:00 | ||

471. Random Touring Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

472. Randomized Approximation – Intro to Theoretical Computer Science | 00:02:00 | ||

473. Randomized Approximation Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

474. Complexity Classes 1 – Intro to Theoretical Computer Science | 00:01:00 | ||

475. Complexity Classes 1 Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

476. Complexity Classes 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

477. Complexity Classes 2 Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

478. Introduction – Intro to Theoretical Computer Science | 00:01:00 | ||

479. Limits Of Computation – Intro to Theoretical Computer Science | 00:02:00 | ||

480. Beauty Of A Painting – Intro to Theoretical Computer Science | 00:03:00 | ||

481. Computer Problems – Intro to Theoretical Computer Science | 00:03:00 | ||

482. Computer Problems Solution – Intro to Theoretical Computer Science | 00:06:00 | ||

483. The Halting Problem – Intro to Theoretical Computer Science | 00:03:00 | ||

484. Does The Program Stop – Intro to Theoretical Computer Science | 00:01:00 | ||

485. Does The Program Stop Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

486. Halt – Intro to Theoretical Computer Science | 00:03:00 | ||

487. Proof By Contradiction – Intro to Theoretical Computer Science | 00:03:00 | ||

488. Inverse Halt Halts – Intro to Theoretical Computer Science | 00:01:00 | ||

489. Inverse Halt Halts Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

490. Inverse Halt Doesn’t Halt – Intro to Theoretical Computer Science | 00:01:00 | ||

491. Inverse Halt Doesn’t Halt – Intro to Theoretical Computer Science | 00:02:00 | ||

492. Contradiction – Intro to Theoretical Computer Science | 00:03:00 | ||

493. Another Approach – Intro to Theoretical Computer Science | 00:02:00 | ||

494. Another Approach Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

495. Logic Crash – Intro to Theoretical Computer Science | 00:03:00 | ||

496. Implications – Intro to Theoretical Computer Science | 00:01:00 | ||

497. Implications Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

498. Intuition Of Undecidability – Intro to Theoretical Computer Science | 00:02:00 | ||

499. Common Pitfall – Intro to Theoretical Computer Science | 00:02:00 | ||

500. Real Computer And Halting Problem – Intro to Theoretical Computer Science | 00:01:00 | ||

501. Real Computer And Halting Problem Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

502. Practical Relevance – Intro to Theoretical Computer Science | 00:01:00 | ||

503. Practical Relevance Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

504. Undecidability – Intro to Theoretical Computer Science | 00:02:00 | ||

505. Collatz – Intro to Theoretical Computer Science | 00:03:00 | ||

506. More Undecidability – Intro to Theoretical Computer Science | 00:03:00 | ||

507. Equivalence Problem – Intro to Theoretical Computer Science | 00:02:00 | ||

508. Equivalence Problem Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

509. Specification – Intro to Theoretical Computer Science | 00:01:00 | ||

510. Rice’s Theorem – Intro to Theoretical Computer Science | 00:02:00 | ||

511. Functional Properties – Intro to Theoretical Computer Science | 00:01:00 | ||

512. Functional Properties Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

513. Statement Of Rice’s Theorem – Intro to Theoretical Computer Science | 00:03:00 | ||

514. Decidable Properties – Intro to Theoretical Computer Science | 00:01:00 | ||

515. Decidable Properties Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

516. Can’t We Decide Anything? – Intro to Theoretical Computer Science | 00:02:00 | ||

517. Malware Detection – Intro to Theoretical Computer Science | 00:01:00 | ||

518. Malware Detection Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

519. Automated Malware Detection – Intro to Theoretical Computer Science | 00:01:00 | ||

520. Automated Malware Detection Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

521. Godel’s Incompleteness Theorem – Intro to Theoretical Computer Science | 00:03:00 | ||

522. Undecidability Vs Semi-decidability – Intro to Theoretical Computer Science | 00:01:00 | ||

523. Undecidability Vs Semi-decidability – Intro to Theoretical Computer Science | 00:01:00 | ||

524. Finite Amount Of Time – Intro to Theoretical Computer Science | 00:01:00 | ||

525. Finite Amount Of Time Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

526. Recursively Enumerable – Intro to Theoretical Computer Science | 00:02:00 | ||

527. Algorithm – Intro to Theoretical Computer Science | 00:01:00 | ||

528. Algorithm Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

529. Congratulations – Intro to Theoretical Computer Science | 00:02:00 | ||

530. A Million Steps – Intro to Theoretical Computer Science | 00:01:00 | ||

531. A Million Steps Solution – Intro to Theoretical Computer Science | 00:01:00 | ||

532. Waiting For Steps – Intro to Theoretical Computer Science | 00:02:00 | ||

533. Waiting For Steps Solution – Intro to Theoretical Computer Science | 00:03:00 | ||

534. Puzzling Words – Intro to Theoretical Computer Science | 00:02:00 | ||

535. Puzzling Words Solution – Intro to Theoretical Computer Science | 00:02:00 | ||

536. Challenge Us – Intro to Theoretical Computer Science | 00:01:00 | ||

537. The Truth About P And NP – Intro to Theoretical Computer Science | 00:01:00 | ||

538. The Truth About P And NP 2 – Intro to Theoretical Computer Science | 00:01:00 | ||

539. Writing A Multisolver – Intro to Theoretical Computer Science | 00:02:00 | ||

540. Your First 3 Sat Solver – Intro to Theoretical Computer Science | 00:02:00 | ||

541. Maximum Satisfaction – Intro to Theoretical Computer Science | 00:01:00 | ||

542. Tour Processing – Intro to Theoretical Computer Science | 00:02:00 | ||

543. Decisions – Intro to Theoretical Computer Science | 00:01:00 | ||

544. Nondeterministic Derandomization – Intro to Theoretical Computer Science | 00:02:00 | ||

Assessment | |||

Submit Your Assignment | 00:00:00 | ||

Certification | 00:00:00 |

### Course Reviews

No Reviews found for this course.

**549 STUDENTS ENROLLED**