1![On the Computational Complexity of MapReduce ´ am D. Lelkes1 , Lev Reyzin1 , Benjamin Fish1 , Jeremy Kun1(B) , Ad´ and Gy¨ orgy Tur´ On the Computational Complexity of MapReduce ´ am D. Lelkes1 , Lev Reyzin1 , Benjamin Fish1 , Jeremy Kun1(B) , Ad´ and Gy¨ orgy Tur´](https://www.pdfsearch.io/img/9edbc4a58e66881f73b8dc2c7669d89a.jpg) | Add to Reading ListSource URL: www.levreyzin.comLanguage: English - Date: 2016-01-18 21:47:16
|
---|
2![A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams†](https://www.pdfsearch.io/img/903be0e4c431362c6ed0d2f59aba500d.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2011-11-07 20:15:16
|
---|
3![Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford](https://www.pdfsearch.io/img/e56199c73c607103f503dd567ee74267.jpg) | Add to Reading ListSource URL: fpt.wdfiles.comLanguage: English - Date: 2013-02-02 11:07:07
|
---|
4![Much Ado about Functions Alan L. Selman Department of Computer Science State University of New York at Buffalo Buffalo, NY[removed]Abstract Much Ado about Functions Alan L. Selman Department of Computer Science State University of New York at Buffalo Buffalo, NY[removed]Abstract](https://www.pdfsearch.io/img/c7f9621c1c673ae499008181155d7410.jpg) | Add to Reading ListSource URL: www.cse.buffalo.eduLanguage: English - Date: 1997-10-21 08:38:33
|
---|
5![POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL Abstract. Toda [36] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P# POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL Abstract. Toda [36] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#](https://www.pdfsearch.io/img/a61205ad3f4d12997057467f01028bef.jpg) | Add to Reading ListSource URL: www.math.purdue.eduLanguage: English - Date: 2010-06-16 13:44:12
|
---|
6![A COMPLEXITY THEORY OF CONSTRUCTIBLE FUNCTIONS AND SHEAVES SAUGATA BASU Abstract. In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model. A COMPLEXITY THEORY OF CONSTRUCTIBLE FUNCTIONS AND SHEAVES SAUGATA BASU Abstract. In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model.](https://www.pdfsearch.io/img/9d9fd7ad1b82fa2b8105fae9d66ee2a8.jpg) | Add to Reading ListSource URL: www.math.purdue.eduLanguage: English - Date: 2013-10-06 09:48:25
|
---|
7![POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL 1. Brief Description Toda proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the cl POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL 1. Brief Description Toda proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the cl](https://www.pdfsearch.io/img/09ffe3a2e2aef4e24b859fbb490edead.jpg) | Add to Reading ListSource URL: www.math.purdue.eduLanguage: English - Date: 2010-06-16 13:35:58
|
---|
8![A COMPLEX ANALOGUE OF TODA’S THEOREM SAUGATA BASU Abstract. Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P , namely the class of languages that can be decided A COMPLEX ANALOGUE OF TODA’S THEOREM SAUGATA BASU Abstract. Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P , namely the class of languages that can be decided](https://www.pdfsearch.io/img/c7604a1f1bac70f2bd687c1be2b31274.jpg) | Add to Reading ListSource URL: www.math.purdue.eduLanguage: English - Date: 2011-09-22 08:25:51
|
---|
9![Midterm • 30 points • Mean: 22.4 Median: 24 Midterm • 30 points • Mean: 22.4 Median: 24](https://www.pdfsearch.io/img/2d036cfe21d1bdad4ff91c65864804a9.jpg) | Add to Reading ListSource URL: users.cms.caltech.eduLanguage: English - Date: 2013-02-20 17:40:47
|
---|
10![](https://www.pdfsearch.io/img/a0674eec1e4258246283bc318cb78608.jpg) | Add to Reading ListSource URL: ftp.cs.rutgers.eduLanguage: English - Date: 2010-04-22 22:13:45
|
---|