Access the full text.
Sign up today, get DeepDyve free for 14 days.
AbstractIt follows from the famous result of Cook about theNP-completeness of the Boolean satisfiability problemthat there is no polynomialalgorithm for this problem if P≠NP{P\neq NP}.In this paper, we prove that the Boolean satisfiability problemremains computationally hard on polynomial strongly generic subsets offormulas provided P≠NP{P\neq NP}and P=BPP{P=BPP}.Boolean formulas are represented in the natural way bylabeled binary trees.
Groups Complexity Cryptology – de Gruyter
Published: Nov 1, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.