Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 2004 Copyright 2004 University of Bonn, Department of Computer Science, Abt. V
85259

30.11.2004

Computational Complexity of Some Restricted Instances of 3SAT
Piotr Berman, Marek Karpinski and Alexander D. Scott
[Download PostScript] [Download PDF]

We prove results on the computational complexity of instances of 3SAT in which every variable occurs 3 or 4 times.

Last Change: 11/05/14 at 10:30:51
 Deutsch 		University of Bonn -> Department of Computer Science -> Chair V