1 / 8

Haim Kaplan, Uri Zwick

Haim Kaplan, Uri Zwick. Tel Aviv University. Algorithms in Action. March 2017 Last updated: March 6, 2018. Course objective. Present elegant , powerful and influential algorithmic ideas that are not fully covered in other courses.

mickle
Download Presentation

Haim Kaplan, Uri Zwick

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Haim Kaplan, Uri Zwick Tel Aviv University Algorithms in Action March 2017Last updated: March 6, 2018

  2. Course objective Present elegant, powerful and influential algorithmic ideas that are not fully covered in other courses. The algorithms should have an interesting theory behind them, as well as practical impact. Our point of view is theoretic.

  3. Tentative list of subjects Fast Fourier Transform (FFT) Multiplicative weight updates Local Search Algorithms SAT algorithms MAX CUT using Semidefinite Programming

  4. Fast Fourier Transform Fast computation of the Discrete Fourier Transform Applications in Signal Processing Multiplying polynomials Multiplying integers String matching problems

  5. Local Search Algorithms Deterministic algorithms Basic concepts Cuts in graphs Clustering (-center, -median, -means) Traveling Salesperson (with Held-Karp bound) Randomized algorithms Markov Chains and Random Walks Metropolis algorithm Simulated Annealing

  6. SAT algorithms Random Walk (Schöning’s algorithm) Resolution Conflict Driven Clause Learning (CDCL)

  7. Multiplicative weight updates Predicting using “expert” advise Applications in learning Applications in optimization Approximating Linear Programs Approximating Semidefinite Programs An approximation algorithm for MAX CUT

  8. Administration Up to 6 theoretical homework assignments. Homework = about 20% of final grade Final exam = about 80% of final grade Exam: 15/06/16 , 04/09/16 Haim Kaplan haimk@post.tau.ac.ilUri Zwick zwick@tau.ac.il www.cs.tau.ac.il/~zwick/ALG-ACT-2018.html

More Related