MAX-3SAT

Results: 32



#Item
1Genomes containing Duplicates are Hard to compare (Extended Abstract)? Cedric Chauve1 , Guillaume Fertin2 , Romeo Rizzi3 , and St´ephane Vialette4 ` Montr´eal LaCIM et D´epartement d’Informatique, Universit´e du Qu

Genomes containing Duplicates are Hard to compare (Extended Abstract)? Cedric Chauve1 , Guillaume Fertin2 , Romeo Rizzi3 , and St´ephane Vialette4 ` Montr´eal LaCIM et D´epartement d’Informatique, Universit´e du Qu

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:57:00
2Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2008-02-01 14:51:28
3RevCalcDisc_MGnewuch_et_al.dvi

RevCalcDisc_MGnewuch_et_al.dvi

Add to Reading List

Source URL: www.numerik.uni-kiel.de

Language: English - Date: 2008-10-15 10:46:12
4Seminar on Sublinear Time Algorithms  Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer

Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2010-05-17 00:53:00
5Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries Marcelo Arenas Pablo Barceló

Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries Marcelo Arenas Pablo Barceló

Add to Reading List

Source URL: web.ing.puc.cl

Language: English - Date: 2013-12-24 11:08:56
6Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries Marcelo Arenas Pablo Barceló

Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries Marcelo Arenas Pablo Barceló

Add to Reading List

Source URL: users.dcc.uchile.cl

Language: English - Date: 2008-12-16 09:36:44
7Beating the random assignment on constraint satisfaction problems of bounded degree Boaz Barak∗ arXiv:1505.03424v1 [cs.CC] 13 May 2015

Beating the random assignment on constraint satisfaction problems of bounded degree Boaz Barak∗ arXiv:1505.03424v1 [cs.CC] 13 May 2015

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2015-05-13 20:27:45
8Resolving the conflict between generality and plausibility in verified computation Srinath Setty? , Benjamin Braun? , Victor Vu? , Andrew J. Blumberg? , Bryan Parno† , and Michael Walfish? ? The University of Texas at

Resolving the conflict between generality and plausibility in verified computation Srinath Setty? , Benjamin Braun? , Victor Vu? , Andrew J. Blumberg? , Bryan Parno† , and Michael Walfish? ? The University of Texas at

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2013-03-10 19:40:43
9Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT Hai Leong Chieu Wee Sun Lee  Singapore MIT Alliance

Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT Hai Leong Chieu Wee Sun Lee Singapore MIT Alliance

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2008-11-06 22:58:52