The complexity of counting problems

Dominic Welsh; Amy Gale

Home Mathematics The complexity of counting problems

Chapter

Licensed

Unlicensed Requires Authentication

The complexity of counting problems

Dominic Welsh and Amy Gale

Published by

Become an author with De Gruyter Brill

Explore this Subject How to publish with us

This chapter is in the book Aspects of Complexity

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

Welsh, Dominic and Gale, Amy. "The complexity of counting problems". Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000, edited by Rod Downey and Denis Hirschfeldt, Berlin, New York: De Gruyter, 2001, pp. 115-154. https://doi.org/10.1515/9783110889178.115

Welsh, D. & Gale, A. (2001). The complexity of counting problems. In R. Downey & D. Hirschfeldt (Ed.), Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000 (pp. 115-154). Berlin, New York: De Gruyter. https://doi.org/10.1515/9783110889178.115

Welsh, D. and Gale, A. 2001. The complexity of counting problems. In: Downey, R. and Hirschfeldt, D. ed. Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000. Berlin, New York: De Gruyter, pp. 115-154. https://doi.org/10.1515/9783110889178.115

Welsh, Dominic and Gale, Amy. "The complexity of counting problems" In Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000 edited by Rod Downey and Denis Hirschfeldt, 115-154. Berlin, New York: De Gruyter, 2001. https://doi.org/10.1515/9783110889178.115

Welsh D, Gale A. The complexity of counting problems. In: Downey R, Hirschfeldt D (ed.) Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000. Berlin, New York: De Gruyter; 2001. p.115-154. https://doi.org/10.1515/9783110889178.115

Copy

Copied to clipboard

BibTeX EndNote RIS

You are currently not able to access this content.

Chapters in this book

Frontmatter I
Basic complexity 1
Three lectures on real computation 29
Parameterized complexity: new developments and research frontiers 51
Kolmogorov complexity 73
Complexity and computation in matrix groups 87
The complexity of counting problems 115
The Ω conjecture 155
List of contributors 171

Search book Search the content of this book

https://doi.org/10.1515/9783110889178.115

Chapters in this book

Frontmatter I
Basic complexity 1
Three lectures on real computation 29
Parameterized complexity: new developments and research frontiers 51
Kolmogorov complexity 73
Complexity and computation in matrix groups 87
The complexity of counting problems 115
The Ω conjecture 155
List of contributors 171

The complexity of counting problems

Chapter PDF View

Chapters in this book

Chapters in this book

Chapters in this book