9 results
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 6 / November 2021
- Published online by Cambridge University Press:
- 12 April 2021, pp. 905-921
-
- Article
- Export citation
Approximately counting bases of bicircular matroids
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 1 / January 2021
- Published online by Cambridge University Press:
- 06 August 2020, pp. 124-135
-
- Article
- Export citation
Counting Unlabelled Subtrees of a Tree is #P-complete
-
- Journal:
- LMS Journal of Computation and Mathematics / Volume 3 / 2000
- Published online by Cambridge University Press:
- 01 February 2010, pp. 117-124
-
- Article
-
- You have access
- Export citation
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
-
- Journal:
- Mathematical Structures in Computer Science / Volume 6 / Issue 3 / June 1996
- Published online by Cambridge University Press:
- 04 March 2009, pp. 251-259
-
- Article
- Export citation
Dobrushin Conditions and Systematic Scan
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 6 / November 2008
- Published online by Cambridge University Press:
- 01 November 2008, pp. 761-779
-
- Article
- Export citation
The Complexity of Ferromagnetic Ising with Local Fields
-
- Journal:
- Combinatorics, Probability and Computing / Volume 16 / Issue 1 / January 2007
- Published online by Cambridge University Press:
- 14 August 2006, pp. 43-61
-
- Article
- Export citation
Convergence of the Iterated Prisoner's Dilemma Game
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 2 / March 2002
- Published online by Cambridge University Press:
- 25 April 2002, pp. 135-147
-
- Article
- Export citation
The ‘Burnside Process’ Converges Slowly
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 1 / January 2002
- Published online by Cambridge University Press:
- 14 February 2002, pp. 21-34
-
- Article
- Export citation
Computational Pólya theory
-
-
- Book:
- Surveys in Combinatorics, 1995
- Published online:
- 05 May 2010
- Print publication:
- 20 July 1995, pp 103-118
-
- Chapter
- Export citation