MAX-3SAT - PDFSEARCH.IO - Document Search Engine

MAX-3SAT
Results: 32

#	Item
21	Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems Add to Reading List Source URL: theoryofcomputing.org Language: English - Date: 2013-06-15 12:40:47 Probability theory NP-complete problems Logic in computer science Elementary mathematics NP-hard problems MAX-3SAT Boolean satisfiability problem Interpretation Belief propagation Mathematics Theoretical computer science Applied mathematics
22	How to Rank with Few Errors ∗ Add to Reading List Source URL: cs.brown.edu Language: English - Date: 2007-03-26 09:22:56 Prime numbers Complex analysis Pi Prime-counting function Randomized algorithm Permutation pattern MAX-3SAT Mathematical analysis Mathematics Analytic number theory
23	Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2013-04-24 07:33:09 Complexity classes Probabilistic complexity theory Mathematical optimization NP-complete problems Probabilistically checkable proof NP PCP theorem P versus NP problem MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics
24	Probabilistic Checking of Proofs and Hardness of Approximation Problems Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2005-03-10 11:31:01 Probabilistic complexity theory Mathematical optimization Probabilistically checkable proof Sanjeev Arora PCP theorem Complexity classes MAX-3SAT Hardness of approximation NP Theoretical computer science Applied mathematics Computational complexity theory
25	Interactive Proofs and the Hardness of Approximating Cliques Uriel Feige ∗ Add to Reading List Source URL: web.cs.elte.hu Language: English - Date: 2007-01-10 14:31:22 Complexity classes Probabilistic complexity theory Mathematical optimization Mathematical proofs Interactive proof system NP Probabilistically checkable proof P versus NP problem MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics
26	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
27	THE COMPLEXITY OF SATISFIABILITY PROBLEMS Thomas J. Schaefer* Department of Mathematics Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2006-08-30 11:43:07 MAX-3SAT Combinatory logic Mathematics Theoretical computer science Computer programming
28	PDF Document Add to Reading List Source URL: www-imai.is.s.u-tokyo.ac.jp Language: English - Date: 2003-05-03 02:39:28 Complexity classes Mathematical optimization NP-complete Boolean satisfiability problem NP IP MAX-3SAT Cook–Levin theorem Theoretical computer science Computational complexity theory Applied mathematics
29	PDF Document Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2003-12-26 03:09:03 Computational complexity theory Karp–Lipton theorem Sipser–Lautemann theorem Arthur–Merlin protocol MAX-3SAT Probabilistic complexity theory Mathematics Applied mathematics
30	PDF Document Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2002-04-24 17:27:28 NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science 2-satisfiability Conjunctive normal form PP MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics