The Computational Complexity of Counting

Mark Jerrum
Additional contact information
Mark Jerrum: University of Edinburgh, Department of Computer Science

A chapter in Proceedings of the International Congress of Mathematicians, 1995, pp 1407-1416 from Springer

Abstract: Abstract The complexity theory of counting contrasts intriguingly with that of existence or optimization.

Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-9078-6_135

Ordering information: This item can be ordered from
http://www.springer.com/9783034890786

DOI: 10.1007/978-3-0348-9078-6_135

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().