The complexity of counting problems

[1]  Steven D. Noble,et al.  Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width , 1998, Combinatorics, Probability and Computing.

[2]  Artur Andrzejak,et al.  An algorithm for the Tutte polynomials of graphs of bounded treewidth , 1998, Discret. Math..

[3]  M. Simonovits,et al.  Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .

[4]  Mark Jerrum,et al.  A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.

[5]  Thomas Schwentick,et al.  The Power of the Middle Bit of a #P Function , 1995, J. Comput. Syst. Sci..

[6]  J. D. Annan,et al.  A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs , 1994, Combinatorics, Probability and Computing.

[7]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[8]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[9]  Osamu Watanabe,et al.  Polynomial Time 1-Turing Reductions from #PH to #P , 1992, Theor. Comput. Sci..

[10]  Dominic J. A. Welsh,et al.  The Computational Complexity of the Tutte Plane: the Bipartite Case , 1992, Combinatorics, Probability and Computing.

[11]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[12]  G. Brightwell,et al.  Counting linear extensions , 1991 .

[13]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.

[14]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[15]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[16]  N. Linial.  Hard enumeration problems in geometry and combinatorics , 1986 .

[17]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[18]  Larry J. Stockmeyer,et al.  On Approximation Algorithms for #P , 1985, SIAM J. Comput..

[19]  Zvi Galil,et al.  NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.

[20]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[21]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[22]  Rudolf Mathon,et al.  A Note on the Graph Isomorphism counting Problem , 1979, Inf. Process. Lett..

[23]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[24]  C. Fortuin,et al.  On the random-cluster model: I. Introduction and relation to other models , 1972 .

[25]  P. W. Kasteleyn.  Dimer Statistics and Phase Transitions , 1963 .

[26]  H. Whitney.  A logical expansion in mathematics , 1932 .

[27]  N. Alon,et al.  Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case , 1994, Electron. Colloquium Comput. Complex..

[28]  Ker-I Ko,et al.  On Some Natural Complete Operators , 1985, Theor. Comput. Sci..

[29]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[30]  Richard P. Stanley,et al.  Acyclic orientations of graphs , 1973, Discret. Math..

[31]  G. Birkhoff.  A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .

[32]  Çetin Meriçli,et al.  General Terms Algorithms , 2022 .