On the algebraic complexity of some families of coloured Tutte polynomials
暂无分享,去创建一个
[1] Stuart A. Kurtz,et al. Gap-definable counting classes , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[2] P. Flajolet. On approximate counting , 1982 .
[3] D. Welsh,et al. On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.
[4] Alan M. Frieze,et al. Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[5] Alan M. Frieze,et al. Electronic Colloquium on Computational Complexity Polynomial Time Randomised Approximation Schemes for Tutte-grr Othendieck Invariants: the Dense Case , 2022 .
[6] Béla Bollobás,et al. A Tutte Polynomial for Coloured Graphs , 1999, Combinatorics, Probability and Computing.
[7] Klaus Meer. Counting Problems over the Reals , 1997, MFCS.
[8] Steven D. Noble,et al. A weighted graph polynomial from chromatic invariants of knots , 1999 .
[9] L. Fortnow. Counting complexity , 1998 .
[10] Leslie G. Valiant,et al. A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[11] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.
[12] A. Selman,et al. Complexity theory retrospective II , 1998 .
[13] K. Ramachandra,et al. Vermeidung von Divisionen. , 1973 .
[14] Lorenzo Traldi,et al. A dichromatic polynomial for weighted graphs and link polynomials , 1989 .
[15] J. V. Tucker,et al. Computable functions and semicomputable sets on many-sorted algebras , 2001, Logic in Computer Science.
[16] Steven D. Noble. COMPLEXITY OF GRAPH POLYNOMIALS , 1997 .
[17] Richard P. Stanley,et al. Graph colorings and related symmetric functions: ideas and applications A description of results, interesting applications, & notable open problems , 1998, Discret. Math..
[18] James G. Oxley,et al. Tutte polynomials computable in polynomial time , 1992, Discret. Math..
[19] Richard P. Stanley,et al. A Symmetric Function Generalization of the Chromatic Polynomial of a Graph , 1995 .
[20] J. D. Annan. The Complexities of the Coefficients of the Tutte Polynomial , 1995, Discret. Appl. Math..
[21] Dominic Welsh. Randomised Approximation Schemes for Tutte-Gröthendieck Invariants , 1995 .
[22] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[23] Leslie G. Valiant,et al. Completeness classes in algebra , 1979, STOC.
[24] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.
[25] Peter Bürgisser,et al. Completeness and Reduction in Algebraic Complexity Theory , 2000, Algorithms and computation in mathematics.
[26] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[27] Peter Bürgisser. Cook's versus Valiant's hypothesis , 2000, Theor. Comput. Sci..
[28] D. Welsh. Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .
[29] Klaus Meer,et al. On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale , 2000, CSL.
[30] Johann A. Makowsky,et al. Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width , 2001, SODA '01.
[31] David R. Karger,et al. A randomized fully polynomial time approximation scheme for the all terminal network reliability problem , 1995, STOC '95.
[32] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[33] Artur Andrzejak,et al. An algorithm for the Tutte polynomials of graphs of bounded treewidth , 1998, Discret. Math..
[34] D. Welsh. The tutte polynomial , 1999 .
[35] Dominic J. A. Welsh. Randomised Approximation in the Tutte Plane , 1994, Comb. Probab. Comput..
[36] Steven D. Noble,et al. Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width , 1998, Combinatorics, Probability and Computing.
[37] G. Sposito,et al. Graph theory and theoretical physics , 1969 .
[38] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.
[39] Mark Jerrum,et al. On the complexity of evaluating multivariate polynomials , 1981 .
[40] Michael Clausen,et al. Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.