Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Reducibility, randomness, and intractability;Adleman;Proc. 9th Annual ACM Symposium on Theory of Computing,1977
2. Relativizations of the P=?NP question;Baker;SIAM J. Comput.,1975
3. A second step toward the polynomial hierarchy;Baker;Theoret. Comput. Sci.,1979
4. Computational complexity of probabilistic Turing machines;Gill;SIAM J. Comput.,1977
5. A note on the graph isomorphism counting problem;Máthon;Information Processing Lett.,1979
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ESampler: Boosting sampling of satisfying assignments for Boolean formulas via derivation;Journal of Systems Architecture;2022-08
2. Chapter 25. Model Counting;Frontiers in Artificial Intelligence and Applications;2021-02-02
3. ESampler: Efficient Sampling of Satisfying Assignments for Boolean Formulas;Dependable Software Engineering. Theories, Tools, and Applications;2021
4. A Scalable Approximate Model Counter;Lecture Notes in Computer Science;2013
5. On a Theorem of Razborov;computational complexity;2011-10-21