Abstract
Classical complexity theory is mainly concerned with complexity of decision problems, e.g., “Is a given graph G Hamiltonian?”1 Formally, a decision problem is a predicate φ: Σ* → {0, 1}, where Σ is some finite alphabet in which problem instances are encoded.2 Thus, x ∈ Σ* might encode a graph G x (as an adjacency matrix, perhaps) and φ(x) is true if G x is Hamiltonian.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Birkhäuser Verlag, P.O. Box 133, CH-4010 Basel, Switzerland
About this chapter
Cite this chapter
Jerrum, M. (2003). #P-completeness. In: Counting, Sampling and Integrating: Algorithm and Complexity. Lectures in Mathematics ETH Zürich. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-8005-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8005-3_2
Published:
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-6946-0
Online ISBN: 978-3-0348-8005-3
eBook Packages: Springer Book Archive