scientific article; zbMATH DE number 850077

MaRDI QIDQ4866091zbMATHFDO

Authors Mark Jerrum

Publication date 4 March 1996

zbMATH Keywords

computational complexitycomplexity theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of counting problems
• scientific article; zbMATH DE number 4064488
• scientific article; zbMATH DE number 1072530
• Complexity dichotomies of counting problems
• Complexity dichotomy for counting problems
• Progress in complexity of counting problems
• scientific article; zbMATH DE number 4072941
• The Parameterized Complexity of Counting Problems
• Computational complexity of counting and sampling
• scientific article; zbMATH DE number 1042857

Cited in

(4)

• On the complexity of calculating factorials
• scientific article; zbMATH DE number 7075922 (Why is no real title available?)
• Complexity dichotomies of counting problems
• Counting Value Sets: Algorithm and Complexity

This page was built for publication:

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