Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Guest column: A panorama of counting problems the decision version of which is in P 3

Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis and Stathis Zachos
ACM SIGACT News 53 (3) 46 (2022)
https://doi.org/10.1145/3561064.3561072

New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems

Eric Allender and Shuichi Hirahara
ACM Transactions on Computation Theory 11 (4) 1 (2019)
https://doi.org/10.1145/3349616

Asymptotic Perturbation Bounds for Probabilistic Model Checking with Empirically Determined Probability Parameters

Guoxin Su, Yuan Feng, Taolue Chen and David S. Rosenblum
IEEE Transactions on Software Engineering 42 (7) 623 (2016)
https://doi.org/10.1109/TSE.2015.2508444

Counting classes and the fine structure between NC1 and L

Samir Datta, Meena Mahajan, B.V. Raghavendra Rao, Michael Thomas and Heribert Vollmer
Theoretical Computer Science 417 36 (2012)
https://doi.org/10.1016/j.tcs.2011.05.050

Mathematical Foundations of Computer Science 2010

Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas and Heribert Vollmer
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2010 6281 306 (2010)
https://doi.org/10.1007/978-3-642-15155-2_28

Equivalence Problems for Circuits over Sets of Natural Numbers

Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen Travers and Matthias Waldherr
Theory of Computing Systems 46 (1) 80 (2010)
https://doi.org/10.1007/s00224-008-9144-8

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes

Maciej Liśkiewicz, Mitsunori Ogihara and Seinosuke Toda
Theoretical Computer Science 304 (1-3) 129 (2003)
https://doi.org/10.1016/S0304-3975(03)00080-X

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science

Thanh Minh Hoang and Thomas Thierauf
Lecture Notes in Computer Science, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science 2556 206 (2002)
https://doi.org/10.1007/3-540-36206-1_19

Foundations of Information Technology in the Era of Network and Mobile Computing

Alina Beygelzimer and Mitsunori Ogihara
Foundations of Information Technology in the Era of Network and Mobile Computing 59 (2002)
https://doi.org/10.1007/978-0-387-35608-2_6

Complexity of finite-horizon Markov decision process problems

Martin Mundhenk, Judy Goldsmith, Christopher Lusena and Eric Allender
Journal of the ACM 47 (4) 681 (2000)
https://doi.org/10.1145/347476.347480

Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds

Eric Allender, Klaus Reinhardt and Shiyu Zhou
Journal of Computer and System Sciences 59 (2) 164 (1999)
https://doi.org/10.1006/jcss.1999.1646

Mathematical Foundations of Computer Science 1997

Martin Mundhenk, Judy Goldsmith and Eric Allender
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 1997 1295 129 (1997)
https://doi.org/10.1007/BFb0029956