Search Sciweavers | Sciweavers

5138 search results - page 4 / 1028

» Randomized Algorithms for 3-SAT

click to vote

COCO
2005
Springer

89views Algorithms» more COCO 2005»

Hardness of Max 3SAT with No Mixed Clauses

14 years 27 days ago

Download www.cs.nyu.edu

We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...

Venkatesan Guruswami, Subhash Khot

claim paper

Read More »

click to vote

IEEEHPCS
2010

207views Applied Computing» more IEEEHPCS 2010»

3-SAT on CUDA: Towards a massively parallel SAT solver

13 years 5 months ago

Download www12.informatik.uni-erlangen.de

This work presents the design and implementation of a massively parallel 3-SAT solver, specifically targeting random problem instances. Our approach is deterministic and features ...

Quirin Meyer, Fabian Schonfeld, Marc Stamminger, R...

claim paper

Read More »

click to vote

FCS
2006

103views Computer Science» more FCS 2006»

Discovering the Impact of Group Structure on 3-SAT

13 years 8 months ago

Download ww1.ucmss.com

-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-vari...

James McQuillan, Craig Damon

claim paper

Read More »

click to vote

FOCS
1997
IEEE

112views Theoretical Computer Science» more FOCS 1997»

A 7/8-Approximation Algorithm for MAX 3SAT?

13 years 11 months ago