Time hierarchy theorem - PDFSEARCH.IO - Document Search Engine

Time hierarchy theorem
Results: 10

#	Item
1	On the Computational Complexity of MapReduce ´ am D. Lelkes1 , Lev Reyzin1 , Benjamin Fish1 , Jeremy Kun1(B) , Ad´ and Gy¨ orgy Tur´ Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2016-01-18 21:47:16 Computational complexity theory Theory of computation Complexity classes Computational resources Structural complexity theory Theoretical computer science MapReduce Time hierarchy theorem NTIME Time complexity DSPACE SL
2	A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-11-07 20:15:16 Complexity classes NTIME Circuit complexity P Bounded-error probabilistic polynomial Cook–Levin theorem Time hierarchy theorem NEXPTIME Time complexity Theoretical computer science Computational complexity theory Applied mathematics
3	Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-02 11:07:07 Complexity classes Mathematical optimization Structural complexity theory Computational resources P versus NP problem NP-complete Circuit complexity P Time hierarchy theorem Theoretical computer science Computational complexity theory Applied mathematics
4	Much Ado about Functions Alan L. Selman Department of Computer Science State University of New York at Buffalo Buffalo, NY[removed]Abstract Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 08:38:33 Structural complexity theory Complexity classes Functions and mappings Computability theory NP Multivalued function Oracle machine Time hierarchy theorem Inverse function Theoretical computer science Mathematics Computational complexity theory
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# Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2010-06-16 13:44:12 Field theory Real algebraic geometry Algebraic geometry Real closed field Betti number Polynomial Algebraic variety Field Semialgebraic set Abstract algebra Mathematics Algebra
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. Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2013-10-06 09:48:25 Algebraic topology Structural complexity theory Field theory Time hierarchy theorem Constructible sheaf Algebraic geometry Sheaf Constructible function Constructible universe Abstract algebra Mathematics Algebra
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 Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2010-06-16 13:35:58 Field theory Algebraic geometry Polynomial Field extension Field Computational complexity theory Betti number Finite field Number Abstract algebra Mathematics Algebra
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 Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2011-09-22 08:25:51 Applied mathematics Constructible universe Polynomial Time hierarchy theorem Algebraic geometry Real closed field Karp–Lipton theorem Constructible number Mathematics Structural complexity theory Abstract algebra
9	Midterm • 30 points • Mean: 22.4 Median: 24 Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2013-02-20 17:40:47 Complexity classes Structural complexity theory Time hierarchy theorem PP P Time complexity MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics
10	PDF Document Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - Date: 2010-04-22 22:13:45 Complexity classes Time hierarchy theorem NTIME DTIME DSPACE NSPACE Space hierarchy theorem Alternating Turing machine EXPTIME Theoretical computer science Computational complexity theory Applied mathematics