Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
 

Summary: The Complexity of Satisfiability Problems:
Refining Schaefer's Theorem
Eric Allender1
, Michael Bauland2
, Neil Immerman3
, Henning Schnoor2
, and
Heribert Vollmer4
1
Department of Computer Science, Rutgers University, Piscataway, NJ 08855,
allender@cs.rutgers.edu
2
Theoretische Informatik, Universitšat Hannover, Appelstr. 4, 30167 Hannover,
Germany. bauland@thi.uni-hannover.de, schnoor@thi.uni-hannover.de
3
Department of Computer and Information Science, University of Massachusetts,
Amherst, MA 01003, immerman@cs.umass.edu
4
Corresponding author: Theoretische Informatik, Universitšat Hannover,
Appelstr. 4, 30167 Hannover, Germany. vollmer@thi.uni-hannover.de.

  

Source: Allender, Eric - Department of Computer Science, Rutgers University

 

Collections: Computer Technologies and Information Sciences