The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems

We reduce the problem of detecting the existence of an object to the problem of computing the parity of the number of objects in question. In particular, when given any non-empty set system, we prove that randomly restricting elements of its ground set makes the size of the restricted set system an odd number with significant probability. When compared to previously known reductions of this type, ours excel in their simplicity: For graph problems, restricting elements of the ground set usually corresponds to simple deletion and contraction operations, which can be encoded efficiently in most problems. We find three applications of our reductions:

1.

An exponential-time algorithm: We show how to decide Hamiltonicity in directed

$$n$$

n

-vertex graphs with running time

$$1.9999^n$$

1

.

9999

n

provided that the graph has at most

$$1.0385^n$$

1

.

0385

n

Hamiltonian cycles. We do so by reducing to the algorithm of Björklund and Husfeldt (FOCS 2013) that computes the parity of the number of Hamiltonian cycles in time

$$1.619^n$$

1

.

619

n

.

2.

A new result in the framework of Cygan et al. (CCC 2012) for analyzing the complexity of NP-hard problems under the Strong Exponential Time Hypothesis: If the parity of the number of Set Covers can be determined in time

$$1.9999^n$$

1

.

9999

n

, then Set Cover can be decided in the same time.

3.

A structural result in parameterized complexity: We define the parameterized complexity class

$$\oplus $$

⊕

W[1] and prove that it is at least as hard as W[1] under randomized fpt-reductions with bounded one-sided error; this is analogous to the classical result

$$\mathrm {NP\subseteq RP^{\oplus P}}$$

NP

⊆

RP

⊕

P

by Toda (SICOMP 1991).