Generic hardness of the Boolean satisfiability problem

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 . In this paper, we prove that the Boolean satisfiability problem remains computationally hard on polynomial strongly generic subsets of...

Full description

Bibliographic Details

Published in:	Groups, complexity, cryptology Vol. 9; no. 2; pp. 151 - 154
Main Author:	Rybalov, Alexander
Format:	Journal Article
Language:	English
Published:	Berlin De Gruyter 01.11.2017 Walter de Gruyter GmbH
Subjects:	68Q17 Boolean algebra Boolean satisfiability problem generic complexity Polynomials probabilistic algorithms Set theory
ISSN:	1867-1144, 1869-6104
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!