Vladik Kreinovich, Olga Kosheleva
      Why the graph isomorphism problem is easier than propositional satisfiability:a possible qualitative explanation
      International Journal of Contemporary Mathematical Sciences, Vol. 11, 2016, no. 3, 97-103
      http://dx.doi.org/10.12988/ijcms.2016.51054

Copyright © 2015 Vladik Kreinovich and Olga Kosheleva. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.