Abstract
It follows from the famous result of Cook about the
NP-completeness of the Boolean satisfiability problem
that there is no polynomial
algorithm for this problem if
Funding source: Russian Science Foundation
Award Identifier / Grant number: 17-11-01117
Funding statement: This work was supported by Russian Science Foundation, grant 17-11-01117.
References
[1] S. Cook, The complexity of theorem proving procedures, Proceedings of the Third Annual ACM Symposium on Theory of Computing, ACM, New York (1971), 151–158. 10.1145/800157.805047Search in Google Scholar
[2] E. Dantsin and E. Hirsch, Worst-case upper bounds, Handbook of Satisfiability, IOS Press, Amsterdam (2008), 359–380. Search in Google Scholar
[3] R. Impagliazzo and A. Wigderson, P=BPP unless E has Subexponential Circuits: Derandomizing the XOR Lemma, Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, ACM, New York (1997), 220–229. 10.1145/258533.258590Search in Google Scholar
[4] I. Kapovich, A. Myasnikov, P. Schupp and V. Shpilrain, Generic-case complexity, decision problems in group theory and random walks, J. Algebra 264 (2003), no. 2, 665–694. 10.1016/S0021-8693(03)00167-4Search in Google Scholar
[5] D. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, 1998. Search in Google Scholar
© 2017 Walter de Gruyter GmbH, Berlin/Boston
