3sat - PDFSEARCH.IO - Document Search Engine

3sat
Results: 68

#	Item
61	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
62	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
63	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
64	PDF Document Add to Reading List Source URL: www-imai.is.s.u-tokyo.ac.jp Language: English - Date: 2004-07-23 02:07:15 NP-complete problems Complexity classes Logic puzzles NP-complete NP PSPACE-complete One-in-three 3SAT Nonogram Kakuro Theoretical computer science Computational complexity theory Applied mathematics
65	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
66	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
67	PDF Document Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2010-03-18 10:25:26 NP-complete problems Complexity classes Vertex cover Graph theory MAX-3SAT Approximation algorithm Graph coloring Clique problem Time complexity Theoretical computer science Computational complexity theory Applied mathematics
68	PDF Document Add to Reading List Source URL: arxiv.org Language: English - Date: 2005-02-24 10:35:07 Field theory Valuation Logarithm MAX-3SAT Normal distribution Abstract algebra Mathematics Algebraic geometry

UPDATE