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

MAX-3SAT
Results: 32

#	Item
11	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Approximate Matching of Curves to Point Sets Paul Accisano ¨ or Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 23:59:44 Complexity classes NP Tangent MAX-3SAT Theoretical computer science Computational complexity theory Geometry
12	CCCG 2010, Winnipeg MB, August 9–11, 2010 Watchman Route in a Simple Polygon with a Rubberband Algorithm Fajie Li∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:14 Mathematical logic Theoretical computer science Pi Trigonometric functions Shortest path problem MAX-3SAT Mathematics Mathematical analysis Algorithm
13	doi:j.ipl Add to Reading List Source URL: www.cc.ntut.edu.tw Language: English - Date: 2008-03-02 23:12:13 Automated theorem proving NP-complete problems Unit propagation 2-satisfiability Time complexity Variable MAX-3SAT (SAT ε-UNSAT) Theoretical computer science Mathematics Computational complexity theory
14	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2000-02-20 22:53:43 NP-complete problems Conjunctive normal form Combinatorics Boolean satisfiability problem String Permutation PP 2-satisfiability MAX-3SAT Theoretical computer science Mathematics Computational complexity theory
15	Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds∗ Yuval Filmus University of Toronto Massimo Lauria Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-05-06 19:14:13 Computational complexity theory Conjunctive normal form Proof complexity PP IP Polynomial Boolean algebra Frege system MAX-3SAT Theoretical computer science Applied mathematics Logic in computer science
16	The Local Lemma is tight for SAT∗ H. Gebauer †, T. Szab´o ‡, G. Tardos § Abstract Add to Reading List Source URL: www.renyi.hu Language: English - Date: 2013-09-26 08:48:45 NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Hypergraph Unsatisfiable core Exponential time hypothesis MAX-3SAT Theoretical computer science Mathematics Applied mathematics
17	AdWords and Generalized On-line Matching Aranyak Mehta Amin Saberi Umesh Vazirani Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2006-04-25 19:22:42 Mathematics Applied mathematics Computer science MAX-3SAT Complex analysis Pi Randomized algorithm
18	Optimal Algorithms and Inapproximability Results for Every CSP? [Extended Abstract] Prasad Raghavendra ∗† Dept. of Computer Science and Eng. University of Washington Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2008-03-16 22:17:02 Symbol Normal distribution Lambda calculus MAX-3SAT Spectral theory of ordinary differential equations Applied mathematics Mathematics Theoretical computer science
19	On Lifting Integer Variables in Minimal Inequalities Amitabh Basu1,2 , Manoel Campelo3,4 , Michele Conforti5 , G´erard Cornu´ejols1,6,7 , Giacomo Zambelli5 November 18, 2009 Abstract This paper contributes to the theor Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2009-11-18 11:00:48 Quantum mechanics MAX-3SAT Mathematics Function Linear temporal logic
20	100225_MUSE_Pass_fuer_3sat_Magazin_4c.indd Add to Reading List Source URL: max-slevogt-galerie.de Language: German - Date: 2014-03-04 02:27:23