Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP

  title={Fine-Grained Dichotomies for the Tutte Plane and Boolean \#CSP},
  author={Cornelius Brand and Holger Dell and Marc Roth},
Jaeger et al. (Math Proc Camb Philos Soc 108(1):35–53, 1990) proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: the evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time algorithms. Dell, Husfeldt, and Wahlén (in: ICALP 2010, vol. 6198, pp. 426–437, Springer, Berlin, Heidelberg, 2010) and Husfeldt and Taslaman (in: IPEC 2010, vol. 6478, pp. 192–203, Springer, Berlin, Heidelberg, 2010) in combination with the results of… 

The Exponential-Time Complexity of the complex weighted #CSP

This paper considers a fine-grained dichotomy of Boolean counting constraint satisfaction problem (#CSP), under the exponential time hypothesis of counting version (#ETH), and proves that #CSP(F) is polynomial-time solvable, otherwise it can not be computed in sub-exponential time unless #ETH fails.

The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid

The lower-bound proofs proceed via a connection due to Crapo and Rota [1970] between the number of tuples of codewords of full support and the Tutte polynomial of the matroid associated with the code, and an earlier-established \#ETH-hardness of counting the solutions to a bipartite $(d,2)$-CSP on $n$ vertices in $d^{o(n)}$ time.

Counting Problems on Quantum Graphs: Parameterized and Exact Complexity Classifications

Novel combinatorial, algebraic and even topological properties of quantum graphs are established that allow them to provide exhaustive parameterized and exact complexity classifications, including necessary, sufficient and mostly explicit tractability criteria, for all of the previous problems.

Technical Report Column

Improved concrete efficiency and security analysis of Reed-Solomon PCPPs and Randomized query complexity of sabotaged and composed functions, Shalev Ben-David, Robin Kothari, TR16-087.

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders

A complete understanding of the coefficients of toroidal grids and selected Cayley graph expanders in the homomorphism basis of the EdgeSub allows us to establish hardness of exact counting using the Complexity Monotonicity framework due to Curticapean, Dell and Marx.

Achieving quantum supremacy with sparse and noisy commuting quantum computations

It is shown that purely classical error-correction techniques can be used to design IQP circuits which remain hard to simulate classically, even in the presence of arbitrary amounts of noise of this form.

Parameterized Counting of Trees, Forests and Matroid Bases

We prove \(\mathsf {\#W[1]}\)-hardness of counting (1) trees with k edges in a given graph, (2) forests with k edges in a given graph, and (3) bases of a given matroid of rank (or nullity) k

Architectures for quantum simulation showing a quantum speedup

This work shows that benchmark settings exhibiting a quantum speedup may require little control in contrast to universal quantum computing, and proposes versatile and feasible schemes of two-dimensional dynamical quantum simulators showing such a quantumSpeedup.

Counting Problems in Parameterized Complexity

The parameterized approach to counting problems is surveyed, with a focus on two topics of recent interest: Counting small patterns in large graphs, and counting perfect matchings and Hamiltonian cycles in well-structured graphs.



Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity

This framework allows us to convert classical #P-hardness results for counting problems into tight lower bounds under #ETH, thus ruling out algorithms with running time $2^{o(n)}$ on graphs with $n$ vertices and $O(n)$ edges.

Computational Complexity of Holant Problems

A novel alternative framework to study the complexity of counting problems, called Holant problems, is proposed, a refinement with a more explicit role for the constraint functions and it is proved that all other cases are #P-hard.

Which Problems Have Strongly Exponential Complexity

A generalized reduction that is based on an algorithm that represents an arbitrary k-CNF formula as a disjunction of 2?nk-C NF formulas that are sparse, that is, each disjunct has O(n) clauses, and shows that Circuit-SAT is SERF-complete for all NP-search problems.

On the computational complexity of the Jones and Tutte polynomials

Abstract 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

The multivariate Tutte polynomial (alias Potts model) for graphs and matroids

This survey discusses some questions concerning the complex zeros of the multivariate Tutte polynomial, along with their physical interpretations in statistical mechanics, and in connection with the Yang--Lee approach to phase transitions and electrical circuit theory.

Complexity of Generalized Satisfiability Counting Problems

A Dichotomy Theorem is proved that if all logical relations involved in a generalized satisfiability counting problem are affine then the number of satisfying assignments of this problem can be computed in polynomial time, otherwise this function is #P-complete.

Combinatorics, complexity, and chance : a tribute to Dominic Welsh

Preface 1. Orbit counting and the Tutte polynomial 2. Eulerian and bipartite orientable matroids 3. Tutte-Whitney polynomials: some history and generalisations 4. A survey on the use of Markov chains

A duality between clause width and clause density for SAT

An improvement to the sparsification lemma of Impagliazzo et al. (1998) showing that instances of k-SAT of density slightly more than exponential in k are almost the hardest instances of f(1-epsi), and some interesting consequences are derived.

Counting perfect matchings as fast as Ryser

This work shows that there is a polynomial space algorithm that counts the number of perfect matchings in an n-vertex graph in O*(2n/2) ⊂ O(1.415n) time, and presents it in the more general setting of computing the hafnian over an arbitrary ring analogously to Ryser's algorithm for permanent computation.

Exponential Time Complexity of the Permanent and the Tutte Polynomial

Conditional lower bounds for well-studied #P-hard problems are shown, relative to (variants of) the Exponential Time Hypothesis (ETH), which says that the satisfiability of <i>n</i>-variable 3-CNF formulas cannot be decided in time exp(<i>o</i>(<i*n</ i>)).