The complexity of counting problems

Dominic Welsh; Amy Gale

Startseite Mathematik The complexity of counting problems

Kapitel

Lizenziert

Nicht lizenziert Erfordert eine Authentifizierung

The complexity of counting problems

Dominic Welsh und Amy Gale

Veröffentlicht von

Veröffentlichen auch Sie bei De Gruyter Brill

Erkunden Sie dieses Fachgebiet So veröffentlichen Sie bei uns

Ein Kapitel aus dem Buch 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

Kopie

In die Zwischenablage kopiert

BibTeX EndNote RIS

Sie haben derzeit keinen Zugang zu diesem Inhalt.

Kapitel in diesem Buch

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

Buch durchsuchen In diesem Buch suchen

https://doi.org/10.1515/9783110889178.115

Kapitel in diesem Buch

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

Kapitel PDF Ansicht

Kapitel in diesem Buch

Kapitel in diesem Buch

Kapitel in diesem Buch