Kotek, Tomer 2017. Graph Polynomials.
Bordewich, Magnus Greenhill, Catherine and Patel, Viresh 2016. Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Structures & Algorithms, Vol. 48, Issue. 1, p. 21.
Ellis-Monaghan, Joanna A. Pangborn, Greta Seeman, Nadrian C. Blakeley, Sam Disher, Conor Falcigno, Mary Healy, Brianna Morse, Ada Singh, Bharti and Westland, Melissa 2016. Design tools for reporter strands and DNA origami scaffold strands. Theoretical Computer Science,
Fish, Andrew Lisitsa, Alexei Stanovský, David and Swartwood, Sarah 2016. Mathematical Software – ICMS 2016.
Huang, Sangxia and Lu, Pinyan 2016. A Dichotomy for Real Weighted Holant Problems. computational complexity, Vol. 25, Issue. 1, p. 255.
Allagan, Julian A. and Mphako-Banda, Eunice 2015. Tutte polynomial of some multigraphs. Quaestiones Mathematicae, Vol. 38, Issue. 5, p. 709.
Peng, Junhao Xiong, Jian and Xu, Guoai 2015. Tutte Polynomial of Pseudofractal Scale-Free Web. Journal of Statistical Physics, Vol. 159, Issue. 5, p. 1196.
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.
Garijo, D. Gegúndez, M.E. Márquez, A. Revuelta, M.P. and Sagols, F. 2014. Computing the Tutte polynomial of Archimedean tilings. Applied Mathematics and Computation, Vol. 242, p. 842.
Goldberg, Leslie Ann and Jerrum, Mark 2014. The Complexity of Computing the Sign of the Tutte Polynomial. SIAM Journal on Computing, Vol. 43, Issue. 6, p. 1921.
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.
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.
Liao, Yunhua Hou, Yaoping and Shen, Xiaoling 2014. Tutte polynomial of the Apollonian network. Journal of Statistical Mechanics: Theory and Experiment, Vol. 2014, Issue. 10, p. P10043.
Marletto, Chiara and Rasetti, Mario 2014. Quantum Physics, Topology, Formal Languages, Computation: A Categorical View as Homage to David Hilbert. Perspectives on Science, Vol. 22, Issue. 1, p. 98.
Murakami, Masahiko Takeshita, Fumio and Tani, Seiichi 2014. Computing HOMFLY polynomials of 2-bridge links from 4-plat representation. Discrete Applied Mathematics, Vol. 162, p. 271.
Pendavingh, R. A. 2014. On the evaluation at (−ι,ι) of the Tutte polynomial of a binary matroid. Journal of Algebraic Combinatorics, Vol. 39, Issue. 1, p. 141.
DIAO, Y. and HETYEI, G. 2013. Relative Tutte Polynomials of Tensor Products of Coloured Graphs. Combinatorics, Probability and Computing, Vol. 22, Issue. 06, p. 801.
Goldberg, Leslie Ann and Jerrum, Mark 2013. A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. SIAM Journal on Computing, Vol. 42, Issue. 3, p. 1132.
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.
We show that determining the Jones polynomial of an alternating link is #P-hard. This is a special case of a wide range of results on the general intractability of the evaluation of the Tutte polynomial T(M; x, y) of a matroid M except for a few listed special points and curves of the (x, y)-plane. In particular the problem of evaluating the Tutte polynomial of a graph at a point in the (x, y)-plane is #P-hard except when (x − 1)(y − 1) = 1 or when (x, y) equals (1, 1), (−1, −1), (0, −1), (−1, 0), (i, −i), (−i, i), (j, j2), (j2, j) where j = e2πi/3
This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.