We aren't endorsed by this school

NYU - CS 99
  • NYU
  • Unknown
  • Unknown

We don't have any documents relating to this course yet.

Help us build our content library by uploading relevant materials from your courses.

NYU | CS Top Documents
  • 83 Pages Lecture-on time series analysis
    Lecture-on Time Series Analysis

    School: NYU

    Course: Adb

    Fast Calculations of Simple Primitives in Time Series Dennis Shasha Department of Computer Science Courant Institute of Mathematical Sciences New York university Joint work with Richard Cole, Xiaojian Zhao (correlation), Zhihua Wang (humming), Yunyue Zhu

  • 1 Page homework5
    Homework5

    School: NYU

    Course: Analytical Methods In Computer Science

    Spring 2011 Analytical Methods in CS Oded Regev Dept. of Computer Science Ecole normale sup rieure, Paris e Homework 5 Due 2011/5/13 Instructions as before. 1. Stronger KKL theorem: Prove the following strengthening of the KKL theorem. There exists a c >

  • 1 Page homework4
    Homework4

    School: NYU

    Course: Analytical Methods In Computer Science

    Spring 2011 Analytical Methods in CS Homework 4 Due 2011/4/29 Oded Regev Dept. of Computer Science Ecole normale sup rieure, Paris e Instructions as before. 1. Learning juntas with queries: Show an algorithm for learning k-juntas in time poly(n, 2k ) usin

  • 2 Pages homework3
    Homework3

    School: NYU

    Course: Analytical Methods In Computer Science

    Homework 3 Due 2011/4/8 Spring 2011 Analytical Methods in CS Oded Regev Dept. of Computer Science Ecole normale sup rieure, Paris e Instructions as before. 1. The Nisan-Szegedy bound [2]: Let f : cfw_0, 1n R be a nonzero function of degree at most d (i.e.

  • 2 Pages homework2
    Homework2

    School: NYU

    Course: Analytical Methods In Computer Science

    Spring 2011 Analytical Methods in CS Homework 2 Due 2011/3/18 Oded Regev Dept. of Computer Science Ecole normale sup rieure, Paris e Instructions as before. 1. Dictatorship test with perfect completeness: Prove that there is no 3-query dictatorship test t

  • 4 Pages lecture4
    Lecture4

    School: NYU

    Course: Analytical Methods In Computer Science

  • 2 Pages homework1
    Homework1

    School: NYU

    Course: Analytical Methods In Computer Science

    Homework 1 Due 2011/2/25 Spring 2011 Analytical Methods in CS Oded Regev Dept. of Computer Science Ecole normale sup rieure, Paris e Instructions Writeup: You must do the writeup alone. For each question, cite all references used (or write none) and colla

  • 46 Pages NP-completeness
    NP-completeness

    School: NYU

    Course: PnP

    P, NP, and NP-Completeness Siddhartha Sen Questions: sssix@cs.princeton.edu Some figures obtained from Introduction to Algorithms, 2nd ed., by CLRS Tractability Polynomial time (p-time) = O(nk), where n is the input size and k is a constant Problems solva

Back to course listings