Pages that link to "Item:Q1401394"

The following pages link to The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394):

Displaying 8 items.

• Pentagonal chains and annuli as models for designing nanostructures from cages (Q282181) (← links)
• Some observations on holographic algorithms (Q1616615) (← links)
• The complexity of counting models of linear-time temporal logic (Q1745344) (← links)
• Counting substrate cycles in topologically restricted metabolic networks (Q2011645) (← links)
• Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs (Q2308511) (← links)
• Computational complexity of counting problems on 3-regular planar graphs (Q2382289) (← links)
• Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes (Q2695474) (← links)
• Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors (Q5091174) (← links)