Yang, Peng; Huang, Yuan; Fu, Zhiguo The computational complexity of Holant problems on 3-regular graphs. (English) Zbl 07809103 Theor. Comput. Sci. 982, Article ID 114256, 13 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Yang} et al., Theor. Comput. Sci. 982, Article ID 114256, 13 p. (2024; Zbl 07809103) Full Text: DOI
Friedrich, Tobias; Göbel, Andreas; Krejca, Martin S.; Pappik, Marcus Polymer dynamics via cliques: new conditions for approximations. (English) Zbl 07636003 Theor. Comput. Sci. 942, 230-252 (2023). MSC: 82-XX PDFBibTeX XMLCite \textit{T. Friedrich} et al., Theor. Comput. Sci. 942, 230--252 (2023; Zbl 07636003) Full Text: DOI arXiv
Hodges, Reuven; Orelowitz, Gidon Approximate counting of standard set-valued tableaux. (English) Zbl 07597108 Theor. Comput. Sci. 934, 7-20 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{R. Hodges} and \textit{G. Orelowitz}, Theor. Comput. Sci. 934, 7--20 (2022; Zbl 07597108) Full Text: DOI arXiv
Liao, Chao; Lin, Jiabao; Lu, Pinyan; Mao, Zhenyu An FPTAS for the hardcore model on random regular bipartite graphs. (English) Zbl 07575089 Theor. Comput. Sci. 929, 174-190 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. Liao} et al., Theor. Comput. Sci. 929, 174--190 (2022; Zbl 07575089) Full Text: DOI
Bai, Zonglei; Cao, Yongzhi; Wang, Hanpin Zero-freeness and approximation of real Boolean Holant problems. (English) Zbl 07533875 Theor. Comput. Sci. 917, 12-30 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{Z. Bai} et al., Theor. Comput. Sci. 917, 12--30 (2022; Zbl 07533875) Full Text: DOI
Antonopoulos, Antonis; Bakali, Eleni; Chalki, Aggeliki; Pagourtzis, Aris; Pantavos, Petros; Zachos, Stathis Completeness, approximability and exponential time results for counting problems with easy decision version. (English) Zbl 07533864 Theor. Comput. Sci. 915, 55-73 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Antonopoulos} et al., Theor. Comput. Sci. 915, 55--73 (2022; Zbl 07533864) Full Text: DOI
Goldberg, Leslie Ann; Lapinskas, John; Richerby, David Faster exponential-time algorithms for approximately counting independent sets. (English) Zbl 1514.68217 Theor. Comput. Sci. 892, 48-84 (2021). MSC: 68R10 05C69 05C85 68W05 68W25 68W40 PDFBibTeX XMLCite \textit{L. A. Goldberg} et al., Theor. Comput. Sci. 892, 48--84 (2021; Zbl 1514.68217) Full Text: DOI arXiv
Greenhill, Catherine; Sfragara, Matteo The switch Markov chain for sampling irregular graphs and digraphs. (English) Zbl 1395.60079 Theor. Comput. Sci. 719, 1-20 (2018). MSC: 60J10 05C07 05C80 PDFBibTeX XMLCite \textit{C. Greenhill} and \textit{M. Sfragara}, Theor. Comput. Sci. 719, 1--20 (2018; Zbl 1395.60079) Full Text: DOI arXiv
Babin, Mikhail A.; Kuznetsov, Sergei O. Dualization in lattices given by ordered sets of irreducibles. (English) Zbl 1356.68225 Theor. Comput. Sci. 658, Part B, 316-326 (2017). MSC: 68T30 06A15 06B23 06E30 68W05 PDFBibTeX XMLCite \textit{M. A. Babin} and \textit{S. O. Kuznetsov}, Theor. Comput. Sci. 658, Part B, 316--326 (2017; Zbl 1356.68225) Full Text: DOI arXiv
Goldberg, Leslie Ann; Jerrum, Mark The complexity of counting locally maximal satisfying assignments of Boolean CSPs. (English) Zbl 1339.68117 Theor. Comput. Sci. 634, 35-46 (2016). MSC: 68Q25 PDFBibTeX XMLCite \textit{L. A. Goldberg} and \textit{M. Jerrum}, Theor. Comput. Sci. 634, 35--46 (2016; Zbl 1339.68117) Full Text: DOI arXiv
Cai, Jin-Yi; Kowalczyk, Michael Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions. (English) Zbl 1300.05246 Theor. Comput. Sci. 494, 63-74 (2013). MSC: 05C70 05C85 05C60 68Q17 PDFBibTeX XMLCite \textit{J.-Y. Cai} and \textit{M. Kowalczyk}, Theor. Comput. Sci. 494, 63--74 (2013; Zbl 1300.05246) Full Text: DOI
Carrasco, Nicolás; Le Bars, Jean-Marie; Viola, Alfredo Enumerative encoding of correlation-immune Boolean functions. (English) Zbl 1294.94037 Theor. Comput. Sci. 487, 23-36 (2013). MSC: 94A60 94D10 PDFBibTeX XMLCite \textit{N. Carrasco} et al., Theor. Comput. Sci. 487, 23--36 (2013; Zbl 1294.94037) Full Text: DOI
Yamakami, Tomoyuki Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems. (English) Zbl 1253.68185 Theor. Comput. Sci. 461, 86-105 (2012). MSC: 68Q25 68W25 68R05 68Q17 PDFBibTeX XMLCite \textit{T. Yamakami}, Theor. Comput. Sci. 461, 86--105 (2012; Zbl 1253.68185) Full Text: DOI arXiv
Cai, Jin-Yi; Kowalczyk, Michael Spin systems on \(k\)-regular graphs with complex edge functions. (English) Zbl 1252.68149 Theor. Comput. Sci. 461, 2-16 (2012). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{J.-Y. Cai} and \textit{M. Kowalczyk}, Theor. Comput. Sci. 461, 2--16 (2012; Zbl 1252.68149) Full Text: DOI
Chebolu, Prasad; Goldberg, Leslie Ann; Martin, Russell The complexity of approximately counting stable matchings. (English) Zbl 1310.68103 Theor. Comput. Sci. 437, 35-68 (2012). MSC: 68Q25 68Q17 05C69 05C70 90C27 91B68 PDFBibTeX XMLCite \textit{P. Chebolu} et al., Theor. Comput. Sci. 437, 35--68 (2012; Zbl 1310.68103) Full Text: DOI
Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji A computational proof of complexity of some restricted counting problems. (English) Zbl 1216.68122 Theor. Comput. Sci. 412, No. 23, 2468-2485 (2011). MSC: 68Q25 05C22 68-04 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Theor. Comput. Sci. 412, No. 23, 2468--2485 (2011; Zbl 1216.68122) Full Text: DOI
Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David The complexity of weighted Boolean #CSP with mixed signs. (English) Zbl 1171.68013 Theor. Comput. Sci. 410, No. 38-40, 3949-3961 (2009). MSC: 68Q25 68T20 PDFBibTeX XMLCite \textit{A. Bulatov} et al., Theor. Comput. Sci. 410, No. 38--40, 3949--3961 (2009; Zbl 1171.68013) Full Text: DOI
Greenberg, Sam; Randall, Dana Convergence rates of Markov chains for some self-assembly and non-saturated Ising models. (English) Zbl 1170.60027 Theor. Comput. Sci. 410, No. 15, 1417-1427 (2009). Reviewer: Utkir Rozikov (Tashkent) MSC: 60J10 60K35 60F05 82B20 PDFBibTeX XMLCite \textit{S. Greenberg} and \textit{D. Randall}, Theor. Comput. Sci. 410, No. 15, 1417--1427 (2009; Zbl 1170.60027) Full Text: DOI
Cooper, Colin; Klasing, Ralf; Radzik, Tomasz A randomized algorithm for the joining protocol in dynamic distributed networks. (English) Zbl 1160.68002 Theor. Comput. Sci. 406, No. 3, 248-262 (2008). MSC: 68M14 68M12 68W20 PDFBibTeX XMLCite \textit{C. Cooper} et al., Theor. Comput. Sci. 406, No. 3, 248--262 (2008; Zbl 1160.68002) Full Text: DOI
Xia, Mingji; Zhang, Peng; Zhao, Wenbo Computational complexity of counting problems on 3-regular planar graphs. (English) Zbl 1124.68083 Theor. Comput. Sci. 384, No. 1, 111-125 (2007). MSC: 68R10 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Xia} et al., Theor. Comput. Sci. 384, No. 1, 111--125 (2007; Zbl 1124.68083) Full Text: DOI
Nakata, Toshio On the expected time for Herman’s probabilistic self-stabilizing algorithm. (English) Zbl 1086.68020 Theor. Comput. Sci. 349, No. 3, 475-483 (2005). MSC: 68M14 68W40 PDFBibTeX XMLCite \textit{T. Nakata}, Theor. Comput. Sci. 349, No. 3, 475--483 (2005; Zbl 1086.68020) Full Text: DOI
Bulatov, Andrei; Grohe, Martin The complexity of partition functions. (English) Zbl 1081.68030 Theor. Comput. Sci. 348, No. 2-3, 148-186 (2005). MSC: 68Q25 05C15 68R10 68T20 PDFBibTeX XMLCite \textit{A. Bulatov} and \textit{M. Grohe}, Theor. Comput. Sci. 348, No. 2--3, 148--186 (2005; Zbl 1081.68030) Full Text: DOI
Dalmau, Víctor; Jonsson, Peter The complexity of counting homomorphisms seen from the other side. (English) Zbl 1086.68054 Theor. Comput. Sci. 329, No. 1-3, 315-323 (2004). MSC: 68Q25 05A15 68Q15 68R10 PDFBibTeX XMLCite \textit{V. Dalmau} and \textit{P. Jonsson}, Theor. Comput. Sci. 329, No. 1--3, 315--323 (2004; Zbl 1086.68054) Full Text: DOI
Matsui, Tomomi; Matsui, Yasuko; Ono, Yoko Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables. (English) Zbl 1094.62072 Theor. Comput. Sci. 326, No. 1-3, 117-135 (2004). MSC: 62H17 60J22 65C40 PDFBibTeX XMLCite \textit{T. Matsui} et al., Theor. Comput. Sci. 326, No. 1--3, 117--135 (2004; Zbl 1094.62072) Full Text: DOI
Feder, Tomás; Madelaine, Florent; Stewart, Iain A. Dichotomies for classes of homomorphism problems involving unary functions. (English) Zbl 1070.68133 Theor. Comput. Sci. 314, No. 1-2, 1-43 (2004). MSC: 68T20 PDFBibTeX XMLCite \textit{T. Feder} et al., Theor. Comput. Sci. 314, No. 1--2, 1--43 (2004; Zbl 1070.68133) Full Text: DOI Link
Dahllöf, Vilhelm; Jonsson, Peter; Beigel, Richard Algorithms for four variants of the exact satisfiability problem. (English) Zbl 1068.68068 Theor. Comput. Sci. 320, No. 2-3, 373-394 (2004). MSC: 68Q25 68Q15 68W40 PDFBibTeX XMLCite \textit{V. Dahllöf} et al., Theor. Comput. Sci. 320, No. 2--3, 373--394 (2004; Zbl 1068.68068) Full Text: DOI
Puricella, Antonio; Stewart, Iain A. Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (English) Zbl 1044.68163 Theor. Comput. Sci. 290, No. 3, 1897-1913 (2003). MSC: 68W05 68R10 PDFBibTeX XMLCite \textit{A. Puricella} and \textit{I. A. Stewart}, Theor. Comput. Sci. 290, No. 3, 1897--1913 (2003; Zbl 1044.68163) Full Text: DOI
Díaz, Josep; Serna, Maria; Thilikos, Dimitrios M. Counting \(H-\)colorings of partial \(k-\)trees. (English) Zbl 0996.68132 Theor. Comput. Sci. 281, No. 1-2, 291-309 (2002). MSC: 68R10 PDFBibTeX XMLCite \textit{J. Díaz} et al., Theor. Comput. Sci. 281, No. 1--2, 291--309 (2002; Zbl 0996.68132) Full Text: DOI
Dyer, M.; Greenhill, C. Polynomial-time counting and sampling of two-rowed contingency tables. (English) Zbl 0949.68009 Theor. Comput. Sci. 246, No. 1-2, 265-278 (2000). MSC: 68M15 68W05 PDFBibTeX XMLCite \textit{M. Dyer} and \textit{C. Greenhill}, Theor. Comput. Sci. 246, No. 1--2, 265--278 (2000; Zbl 0949.68009) Full Text: DOI