Cook–Levin theorem - PDFSEARCH.IO - Document Search Engine

Cook–Levin theorem
Results: 17

#	Item
1	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
2	Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, but Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:23 Complexity classes Mathematical optimization Structural complexity theory Computability theory NP-hard NP-complete Boolean satisfiability problem Cook–Levin theorem P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
3	Pattern matching with mismatches (Hamming distance) Advanced Algorithms – COMS31900Input A text string T (length n) and a pattern string P (length m) 0 Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:20 Summation Combinatorics Integer sequences Number theory Cook–Levin theorem Binomial coefficient Mathematics Arithmetic Mathematical notation
4	Improved Soundness for QMA with Multiple Provers Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-01-14 01:47:53 Quantum complexity theory QMA Probabilistic complexity theory Proof theory Model theory IP Probabilistically checkable proof Cook–Levin theorem Time complexity Theoretical computer science Computational complexity theory Applied mathematics
5	Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2014-04-01 09:13:02 Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics
6	Motivation COMS21103 NP-completeness Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes NP-complete NP-hard P versus NP problem NP Cook–Levin theorem Boolean satisfiability problem PP P Theoretical computer science Computational complexity theory Applied mathematics
7	On Teaching the Basics of Complexity Theory (In Memory of Shimon Even [1935{2004]) Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:22 Complexity classes NP-complete NP-hard P versus NP problem Co-NP NP Cook–Levin theorem Oracle machine Reduction Theoretical computer science Computational complexity theory Applied mathematics
8	Reasoning about A c t i o n in Polynomial T i m e T h o m a s D r a k e n g r e n and M a r c u s B j a r e l a n d Department of Computer and Information Science Link6ping University, S[removed]Linkoping, Sweden email: { Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-01-24 05:33:24 Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation P-complete Temporal logic Frame problem Cook–Levin theorem Theoretical computer science Applied mathematics Mathematics
9	Ph/CS 219, 4 March 2009 "Quantum Merlin-Arthur and the local Hamiltonian problem" As we have discussed, we expect that quantum computers can compute the ground state energy of local Hamiltonians in cases where the proble Add to Reading List Source URL: www.theory.caltech.edu Language: English - Date: 2009-03-11 19:28:20 Complexity classes Mathematical optimization Quantum complexity theory Structural complexity theory P versus NP problem QMA Boolean satisfiability problem NP Cook–Levin theorem Theoretical computer science Computational complexity theory Applied mathematics
10	7. Complexity: P & NP Optimization Problems find an optimal solution, most common in praxis implies Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-11-28 16:45:16 Complexity classes NP P versus NP problem Boolean satisfiability problem P Time complexity Optimization problem Reduction Cook–Levin theorem Theoretical computer science Computational complexity theory Applied mathematics