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

Overview of attention for article published in Theoretical Computer Science, July 2003

Altmetric Badge

About this Attention Score

In the top 25% of all research outputs scored by Altmetric
High Attention Score compared to outputs of the same age (92nd percentile)
High Attention Score compared to outputs of the same age and source (88th percentile)

So far, Altmetric has seen 4 Q&A posts from 4 users.

The only examples of $\sharp P_1$ complete problems I've seen are fairly abstract : e.g. here https://www.math.cmu.edu/~af1p/Teac…

This question caught my atention recently. Most (if not all) of the answers aproached the problem via a brute force attack.

Let #EXP be the counting variant of NEXP, in the same way that #P is the counting variant of NP. Are there any known #EXP-comple…

It is $NP$-hard to find a constant factor approximation of longest cycle in cubic Hamiltonian graphs. Cubic Hamiltonian graphs…

This page shows the most recent Q&A posts that mention this research output. Click here to find out how to access more activity.