Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Alexander N. Rybalov. Generic hardness of the Boolean satisfiability problem. Groups Complexity Cryptology, 9(2):151-154, 2017. [doi]
No references recorded for this publication.
No citations of this publication recorded.