On the counting complexity of mathematical nanosciences

zbMATH Open1474.92171MaRDI QIDQ5013000FDOQ5013000

Authors: J. Andres Montoya 

Publication date: 26 November 2021

Full work available at URL: https://match.pmf.kg.ac.rs/electronic_versions/Match86/n3/match86n3_453-488.pdf

Recommendations

• The complexity of counting in sparse, regular, and planar graphs
• scientific article; zbMATH DE number 1072530
• The complexity of partition functions
• The complexity of counting homeomorphs
• Computational complexity of Holant problems

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

This page was built for publication: On the counting complexity of mathematical nanosciences

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