@article{181980423f7249bb9b4b7be1ad1c356b,
title = "On limitations of transformations between combinatorial problems",
author = "William Slough and Karl Winklmann",
note = "We define a class of {"}local transformations{"} that includes many transformations from the NP-completeness literature. We then prove (without assuming P≠NP) that this type of transformation is too weak to transform 3SAT or a number of other NP-complete problems into 2SAT or a number of other problems in P.",
year = "1991",
month = dec,
day = "1",
doi = "10.1007/BF02090395",
language = "American English",
volume = "24",
journal = "Theory of Computing Systems \textbackslash{}/ Mathematical Systems Theory",
}