Seminar on DNA Computing
Bio Molecular Computing
Kees van Deemter Matthew Stone Formal Issues in Natural Language Generation Lecture 5 Stone, Doran,Webber, Bleam & Palmer.
1 The syllabus revisited Introduction Swarm Intelligence Neural networks Evolutionary computing Special Topics –2 or 3 lectures on other areas of bioinspired.
1 NP-Completeness Zeph Grunschlag. 2 Announcement HW9 Due Now HW Amnesty I’ll drop your lowest hw score.
Paths and Polynomials
DNA Computation Hiroshi Higuchi. Outline Introduction to DNA Adleman’s experiment Cutting Edge Technologies Pros and Cons Conclusion.
1 The TSP : Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell (1872 - 1970)
1 ©D.Moshkovitz Complexity The Traveling Salesman Problem.
A study of k-ordered hamiltonian graphs. Story begins L. Ng, M. Schultz, k-Ordered Hamiltonian graphs, J. Graph Theory 24 (1997) 45–57.
1 Chapter 34: NP-Completeness. 2 About this Tutorial What is NP ? How to check if a problem is in NP ? Cook-Levin Theorem Showing one of the most difficult.
Designing Oracles for Grover Algorithm. Homework 1.You have time until December 3 to return me this homework. 2.Please use PPT, Word or some word processor.