Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Goldberg, Leslie Ann
and
Jerrum, Mark
2010.
Automata, Languages and Programming.
Vol. 6198,
Issue. ,
p.
396.
Chebolu, Prasad
Goldberg, Leslie Ann
and
Martin, Russell
2010.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.
Vol. 6302,
Issue. ,
p.
81.
Dell, Holger
Husfeldt, Thore
and
Wahlén, Martin
2010.
Automata, Languages and Programming.
Vol. 6198,
Issue. ,
p.
426.
Ellis-Monaghan, Joanna A.
and
Moffatt, Iain
2011.
The Tutte–Potts connection in the presence of an external magnetic field.
Advances in Applied Mathematics,
Vol. 47,
Issue. 4,
p.
772.
GE, Q.
and
ŠTEFANKOVIČ, D.
2012.
A Graph Polynomial for Independent Sets of Bipartite Graphs.
Combinatorics, Probability and Computing,
Vol. 21,
Issue. 5,
p.
695.
Goldberg, Leslie Ann
and
Jerrum, Mark
2012.
Approximating the partition function of the ferromagnetic Potts model.
Journal of the ACM,
Vol. 59,
Issue. 5,
p.
1.
Goldberg, Leslie
and
Jerrum, Mark
2012.
A counterexample to rapid mixing of the Ge-Štefankovič
process.
Electronic Communications in Probability,
Vol. 17,
Issue. none,
Chebolu, Prasad
Goldberg, Leslie Ann
and
Martin, Russell
2012.
The complexity of approximately counting stable roommate assignments.
Journal of Computer and System Sciences,
Vol. 78,
Issue. 5,
p.
1579.
Chebolu, Prasad
Goldberg, Leslie Ann
and
Martin, Russell
2012.
The complexity of approximately counting stable matchings.
Theoretical Computer Science,
Vol. 437,
Issue. ,
p.
35.
Bulatov, Andrei A.
Dyer, Martin
Goldberg, Leslie Ann
Jerrum, Mark
and
Mcquillan, Colin
2013.
The expressibility of functions on the boolean domain, with applications to counting CSPs.
Journal of the ACM,
Vol. 60,
Issue. 5,
p.
1.
Goldberg, Leslie Ann
and
Jerrum, Mark
2013.
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials.
Journal of Computer and System Sciences,
Vol. 79,
Issue. 1,
p.
68.
Goldberg, Leslie Ann
and
Jerrum, Mark
2014.
The Complexity of Approximately Counting Tree Homomorphisms.
ACM Transactions on Computation Theory,
Vol. 6,
Issue. 2,
p.
1.
Dell, Holger
Husfeldt, Thore
Marx, Dániel
Taslaman, Nina
and
Wahlén, Martin
2014.
Exponential Time Complexity of the Permanent and the Tutte Polynomial.
ACM Transactions on Algorithms,
Vol. 10,
Issue. 4,
p.
1.
Iblisdir, S.
Cirio, M.
Boada, O.
and
Brennen, G.K.
2014.
Low depth quantum circuits for Ising models.
Annals of Physics,
Vol. 340,
Issue. 1,
p.
205.
Etessami, Kousha
Stewart, Alistair
and
Yannakakis, Mihalis
2014.
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing.
ACM Transactions on Computation Theory,
Vol. 6,
Issue. 2,
p.
1.
Matsuo, Akira
Fujii, Keisuke
and
Imoto, Nobuyuki
2014.
Quantum algorithm for an additive approximation of Ising partition functions.
Physical Review A,
Vol. 90,
Issue. 2,
Zhang, Jian
Djolonga, Josip
and
Krause, Andreas
2015.
Higher-Order Inference for Multi-class Log-Supermodular Models.
p.
1859.
Goldberg, Leslie Ann
Gysel, Rob
and
Lapinskas, John
2015.
Automata, Languages, and Programming.
Vol. 9134,
Issue. ,
p.
654.
Liu, Jingcheng
and
Lu, Pinyan
2015.
FPTAS for #BIS with Degree Bounds on One Side.
p.
549.
Goldberg, Leslie Ann
and
Jerrum, Mark
2015.
A complexity classification of spin systems with an external field.
Proceedings of the National Academy of Sciences,
Vol. 112,
Issue. 43,
p.
13161.