A note on a counting problem arising in percolation theory

DOI10.1016/0012-365X(93)90377-6zbMATH Open0795.68149OpenAlexW2086052665MaRDI QIDQ685697FDOQ685697

Rafi Levy, Eli Shamir

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90377-6

zbMATH Keywords

counting problem\(\#P\)-completepercolation theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Acyclic orientations of graphs
• Hard Enumeration Problems in Geometry and Combinatorics

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• Counting trees in a graph is \(\# \text{P}\)-complete 👍 👎
• The complexity of counting homeomorphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A note on a counting problem arising in percolation theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685697)