Keyword

satisfiability counting

Description: The computational task of counting satisfying assignments of a logical formula or constraint system, commonly studied in complexity theory.
OpenAlex ID: keywords/satisfiability-counting
2005 · Ramamohan Paturi, Pavel Pudlák, et al. · Journal of the ACM · 291
1996 · Nadia Creignou, Miki Hermann · Information and Computation · 242
2014 · Holger Dell, Thore Husfeldt, et al. · ACM Transactions on Algorithms · 141
2017 · Paul Beame, Jerry Li, et al. · ACM Transactions on Database Systems · 105
2002 · M. Luby, B. Velickovic, et al. · Israel Symposium on Theory and Computing Systems (ISTCS) · 90
2019 · Stefanos Kourtis, Claudio Chamon, et al. · SciPost Physics · 75
2002 · D. Zuckerman · IEEE Conference on Computational Complexity (CCC) · 75
2013 · Parikshit Gopalan, Raghu Meka, et al. · Computational Complexity · 68
2010 · Martin E. Dyer, David M. Richerby · ACM Symposium on Theory of Computing (STOC) · 60
2007 · Vibhav Gogate, Rina Dechter · National Conference on Artificial Intelligence · 57
2004 · Luca Trevisan · Lecture notes in computer science · 47
2011 · Michael Alekhnovich, Alexander Razborov · Computational Complexity · 46
2013 · Beame, Paul, Li, Jerry, et al. · arXiv (Cornell University) · 36
2020 · Cody D. Murray, R. Ryan Williams · SIAM Journal on Computing · 33
2014 · Leslie Ann Goldberg, Mark Jerrum · SIAM Journal on Computing · 33
2009 · Reuven Rubinstein · Methodology And Computing In Applied Probability · 33
2010 · Holger Dell, Thore Husfeldt, et al. · Lecture notes in computer science · 28
2023 · Kun He, Chunyang Wang, et al. · Society for Industrial and Applied Mathematics eBooks · 23
2011 · Reuven Rubinstein · Methodology And Computing In Applied Probability · 22
2018 · R. Ryan Williams · Theory of Computing · 21
2004 · Erin Parker, Siddhartha Chatterjee · Lecture notes in computer science · 18
2015 · Radislav Vaisman, Dirk P. Kroese · Methodology And Computing In Applied Probability · 16
2013 · Nielsen, Thomas D., Wuillemin, Pierre-Henri, et al. · VBN Forskningsportal (Aalborg Universitet) · 16
2012 · Parikshit Gopalan, Raghu Meka, et al. · IEEE Conference on Computational Complexity (CCC) · 16
Works count: 95
Citation count: 1,755
Year
Topic
Type