A fast parallel SAT-solver — efficient workload balancing
Böhm, Max, Speckenmeyer, Ewald
Published in Annals of mathematics and artificial intelligence (01.01.1996)
Published in Annals of mathematics and artificial intelligence (01.01.1996)
Get full text
Journal Article
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems
Get full text
Book Chapter
Conference Proceeding
Exact 3-satisfiability is decidable in time O(20.16254n )
Porschen, Stefan, Randerath, Bert, Speckenmeyer, Ewald
Published in Annals of mathematics and artificial intelligence (01.01.2005)
Published in Annals of mathematics and artificial intelligence (01.01.2005)
Get full text
Journal Article
Improving a fixed parameter tractability time bound for the shadow problem
Heusch, Peter, Porschen, Stefan, Speckenmeyer, Ewald
Published in Journal of computer and system sciences (01.12.2003)
Published in Journal of computer and system sciences (01.12.2003)
Get full text
Journal Article
An algorithm for the class of pure implicational formulas
Franco, John, Goldsmith, Judy, Schlipf, John, Speckenmeyer, Ewald, Swaminathan, R.P.
Published in Discrete Applied Mathematics (15.10.1999)
Published in Discrete Applied Mathematics (15.10.1999)
Get full text
Journal Article