On a Generalization of Extended Resolution

Abstract

Motivated by improved SAT algorithms ((O. Kullmann, DIMACS Series, vol. 35, Amer. Math. Soc., Providence, RI, 1997; O. Kullmann, Theoret. Comput. Sci. (1999); O. Kullmann, Inform. Comput., submitted); yielding new worst-case upper bounds) a natural parameterized generalization GER of Extended Resolution (ER) is introduced. ER can simulate polynomially GER, but GER allows special cases for which exponential lower bounds can be proven. ? 1999 Elsevier Science B.V. All rights reserved.

DOI: 10.1016/S0166-218X(99)00037-2

Extracted Key Phrases

01020'98'00'02'04'06'08'10'12'14'16
Citations per Year

106 Citations

Semantic Scholar estimates that this publication has 106 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Kullmann1999OnAG, title={On a Generalization of Extended Resolution}, author={Oliver Kullmann}, journal={Discrete Applied Mathematics}, year={1999}, volume={96-97}, pages={149-176} }