First Page | Document Content | |
---|---|---|
![]() Date: 2007-01-08 22:02:22Decision tree model Randomized algorithm NP PP P versus NP problem Certificate Aanderaa–Karp–Rosenberg conjecture Communication complexity Theoretical computer science Applied mathematics Computational complexity theory | Source URL: www.cs.princeton.eduDownload Document from Source WebsiteFile Size: 197,42 KBShare Document on Facebook |
![]() | Property Testing and Its Connection to Learning and Approximation ODED GOLDREICH Weizmann Institute of Science, Rehovot, Israel SHAFI GOLDWASSERDocID: 18X5D - View Document |
![]() | Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus, Toniann Pitassi, Robert Robere and Stephen A. Cook Department of Computer Science University of Toronto Toronto, Canada {yuvalf, toni, robere, sacooDocID: 14yCi - View Document |
![]() | Monotonicity testing over general poset domains [Extended Abstract] Eldar Fischer Eric LehmanDocID: 14bNq - View Document |
![]() | Simpler Exact Leader Election via Quantum ReductionDocID: 13SUf - View Document |
![]() | Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus∗∗ Toniann Pitassi∗† Robert Robere∗‡DocID: 13GIS - View Document |