1![c 2008 International Press COMMUNICATIONS IN INFORMATION AND SYSTEMS Vol. 8, No. 2, pp[removed], 2008](https://www.pdfsearch.io/img/a40541404a09655178ee726a4c5ecab8.jpg "c 2008 International Press COMMUNICATIONS IN INFORMATION AND SYSTEMS Vol. 8, No. 2, pp[removed], 2008") | Add to Reading ListSource URL: www.ims.cuhk.edu.hkLanguage: English - Date: 2009-02-19 08:06:22
|
|---|
2![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 "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#") | Add to Reading ListSource URL: www.math.purdue.eduLanguage: English - Date: 2010-06-16 13:44:12
|
|---|
3 | Add to Reading ListSource URL: www.math.purdue.eduLanguage: English - Date: 2010-06-16 13:35:58
|
|---|
4![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 "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") | Add to Reading ListSource URL: www.math.purdue.eduLanguage: English - Date: 2011-09-22 08:25:51
|
|---|
5 | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2008-01-31 23:31:47
|
|---|