Academic Commons Search Results
https://academiccommons.columbia.edu/catalog?action=index&controller=catalog&f%5Bauthor_facet%5D%5B%5D=Hemachandra%2C+Lane+A.&f%5Bdepartment_facet%5D%5B%5D=Computer+Science&format=rss&fq%5B%5D=has_model_ssim%3A%22info%3Afedora%2Fldpd%3AContentAggregator%22&q=&rows=500&sort=record_creation_date+desc
Academic Commons Search Resultsen-usOn the Power of Probabilistic Polynomial Time:
PNP[log] ⊆ PP
https://academiccommons.columbia.edu/catalog/ac:142778
Hemachandra, Lane A.; Wechsung, Gerd10.7916/D83X8FRJMon, 19 Jun 2017 14:40:06 +0000We show that every set in the ΘP2 level of the polynomial hierarchy -- that is, every set polynomial-time truth-table reducible to SAT -- is accepted by a probabilistic polynomialtime Turing machine: PNP[log] ⊆ PP.Computer scienceComputer ScienceReportsStructure of Complexity Classes: Separations, Collapses, and Completeness
https://academiccommons.columbia.edu/catalog/ac:142679
Hemachandra, Lane A.10.7916/D86W9K5JMon, 19 Jun 2017 14:39:44 +0000During the last few years, unprecedented programs has been made in structural complexity theory; class inclusions and relativised separations were discovered, and hierarchies collapsed. We survey this progress, highlighting the central role of counting techniques. We also present a new result whose proof demonstrate the power of combinational arguments: there is a relativezed world in which UP has no Turing complete sets.Computer scienceComputer ScienceReportsOn the Structure of Solutions of Computable Real Functions
https://academiccommons.columbia.edu/catalog/ac:142682
Hartmanis, Juris; Hemachandra, Lane A.10.7916/D8BK1MFNMon, 19 Jun 2017 14:39:43 +0000The relationship between the structure of a domain and the complexity of computing over that domain is a fundamental question of computer science. This paper studies how the structure of the real numbers constrains the behavior of computable real functions. In particular, we uncover a close correlation between the structure of the zero set of a computable real function, and the complexity of the zeros. We show that computable real functions with hard solutions perforce have many solutions. Furthermore, as the complexity of solutions increases, the number of solutions increases. We prove that computable real functions with nonrecursive, nonarithmetical, or random zeros have solution sets that are, respectively, infinite,“˜ uncountable, or of positive measure. In addition, we show that the computational complexity of the zero set of a computable real function is limited by its topological complexity. These results suggest an emerging paradigm-the inability of machines to name complex strings can serve as the basis of powerful proof techniques in computational complexity theory.Computer scienceComputer ScienceReportsOn the Power of Parity Polynomial Time
https://academiccommons.columbia.edu/catalog/ac:142061
Cai, Jin-yi; Hemachandra, Lane A.10.7916/D8M90HNFMon, 19 Jun 2017 13:36:45 +0000This paper proves that the complexity class Ef)P, parity polynomial time [PZ83], contains the class of languages accepted by NP machines with few accepting paths. Indeed, Ef)P contains a. broad class of languages accepted by path-restricted nondeterministic machines. In particular, Ef)P contains the polynomial accepting path versions of NP, of the counting hierarchy, and of ModmNP for m > 1. We further prove that the class of nondeterministic path-restricted languages is closed under bounded truth-table reductions.Computer scienceComputer ScienceReports