Partial matching width and its application to lower bounds for branching programs

09/26/2017
by   Igor Razgon, et al.
0

We introduce a new structural graph parameter called partial matching width. For each (sufficiently large) integer k ≥ 1, we introduce a class G_k of graphs of treewidth at most k and max-degree 7 such that for each G ∈G_k and each (sufficiently large) V ⊆ V(G), the partial matching width of V is Ω(k |V|). We use the above lower bound to establish a lower bound on the size of non-deterministic read-once branching programs (NROBPs). In particular, for each sufficiently large ineteger k, we introduce a class Φ_k of CNFs of (primal graph) treewidth at most k such that for any φ∈Φ_k and any Boolean function F ⊆φ and such that |φ|/|F| ≤ 2^√(n) (here the functions are regarded as sets of assignments on which they are true), a NROBP implementing F is of size n^Ω(k). This result significantly generalises an earlier result of the author showing a non-FPT lower bound for NROBPs representing CNFs of bounded treewidth. Intuitively, we show that not only those CNFs but also their arbitrary one side approximations with an exponential ratio still attain that lower bound. The non-trivial aspect of this approximation is that due to a small number of satisfying assignments for F, it seems difficult to establish a large bottleneck: the whole function can `sneak' through a single rectangle corresponding to just one vertex of the purported bottleneck. We overcome this problem by simultaneously exploring √(n) bottlenecks and showing that at least one of them must be large. This approach might be useful for establishing other lower bounds for branching programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2015

On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth

In this paper we study complexity of an extension of ordered binary deci...
research
01/06/2022

The splitting power of branching programs of bounded repetition and CNFs of bounded width

In this paper we study syntactic branching programs of bounded repetitio...
research
08/25/2017

Non-FPT lower bounds for structural restrictions of decision DNNF

We give a non-FPT lower bound on the size of structured decision DNNF an...
research
09/18/2017

Connecting Width and Structure in Knowledge Compilation

Several query evaluation tasks can be done via knowledge compilation: th...
research
09/18/2017

Connecting Width and Structure in Knowledge Compilation (Extended Version)

Several query evaluation tasks can be done via knowledge compilation: th...
research
11/02/2014

On the read-once property of branching programs and CNFs of bounded treewidth

In this paper we prove a space lower bound of n^Ω(k) for non-determinist...
research
09/29/2022

A dichotomy for succinct representations of homomorphisms

The task of computing homomorphisms between two finite relational struct...

Please sign up or login with your details

Forgot password? Click here to reset