136 research outputs found
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the
edges of a bipartite planar graph so that the minimum weight perfect matching
becomes unique. The isolation lemma as described in (Mulmuley et al. 1987)
achieves the same for general graphs using a randomized weighting scheme,
whereas we can do it deterministically when restricted to bipartite planar
graphs. As a consequence, we reduce both decision and construction versions of
the matching problem to testing whether a matrix is singular, under the promise
that its determinant is 0 or 1, thus obtaining a highly parallel SPL algorithm
for bipartite planar graphs. This improves the earlier known bounds of
non-uniform SPL by (Allender et al. 1999) and by (Miller and Naor 1995,
Mahajan and Varadarajan 2000). It also rekindles the hope of obtaining a
deterministic parallel algorithm for constructing a perfect matching in
non-bipartite planar graphs, which has been open for a long time. Our
techniques are elementary and simple
Revisiting the Equivalence Problem for Finite Multitape Automata
The decidability of determining equivalence of deterministic multitape
automata (or transducers) was a longstanding open problem until it was resolved
by Harju and Karhum\"{a}ki in the early 1990s. Their proof of decidability
yields a co_NP upper bound, but apparently not much more is known about the
complexity of the problem. In this paper we give an alternative proof of
decidability, which follows the basic strategy of Harju and Karhumaki but
replaces their use of group theory with results on matrix algebras. From our
proof we obtain a simple randomised algorithm for deciding language equivalence
of deterministic multitape automata and, more generally, multiplicity
equivalence of nondeterministic multitape automata. The algorithm involves only
matrix exponentiation and runs in polynomial time for each fixed number of
tapes. If the two input automata are inequivalent then the algorithm outputs a
word on which they differ
A Fast Parameterized Algorithm for Co-Path Set
The k-CO-PATH SET problem asks, given a graph G and a positive integer k,
whether one can delete k edges from G so that the remainder is a collection of
disjoint paths. We give a linear-time fpt algorithm with complexity
O^*(1.588^k) for deciding k-CO-PATH SET, significantly improving the previously
best known O^*(2.17^k) of Feng, Zhou, and Wang (2015). Our main tool is a new
O^*(4^{tw(G)}) algorithm for CO-PATH SET using the Cut&Count framework, where
tw(G) denotes treewidth. In general graphs, we combine this with a branching
algorithm which refines a 6k-kernel into reduced instances, which we prove have
bounded treewidth
Monotone Projection Lower Bounds from Extended Formulation Lower Bounds
In this short note, we reduce lower bounds on monotone projections of
polynomials to lower bounds on extended formulations of polytopes. Applying our
reduction to the seminal extended formulation lower bounds of Fiorini, Massar,
Pokutta, Tiwari, & de Wolf (STOC 2012; J. ACM, 2015) and Rothvoss (STOC 2014;
J. ACM, 2017), we obtain the following interesting consequences.
1. The Hamiltonian Cycle polynomial is not a monotone subexponential-size
projection of the permanent; this both rules out a natural attempt at a
monotone lower bound on the Boolean permanent, and shows that the permanent is
not complete for non-negative polynomials in VNP under monotone
p-projections.
2. The cut polynomials and the perfect matching polynomial (or "unsigned
Pfaffian") are not monotone p-projections of the permanent. The latter, over
the Boolean and-or semi-ring, rules out monotone reductions in one of the
natural approaches to reducing perfect matchings in general graphs to perfect
matchings in bipartite graphs.
As the permanent is universal for monotone formulas, these results also imply
exponential lower bounds on the monotone formula size and monotone circuit size
of these polynomials.Comment: Published in Theory of Computing, Volume 13 (2017), Article 18;
Received: November 10, 2015, Revised: July 27, 2016, Published: December 22,
201
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs.
They are known to be in L for graphs of tree-width 2 [JT07]. However, for
graphs of tree-width larger than 2, no bound better than NL is known. In this
paper, we improve these bounds for k-trees, where k is a constant. In
particular, the main results of our paper are log-space algorithms for
reachability in directed k-trees, and for computation of shortest and longest
paths in directed acyclic k-trees.
Besides the path problems mentioned above, we also consider the problem of
deciding whether a k-tree has a perfect macthing (decision version), and if so,
finding a perfect match- ing (search version), and prove that these two
problems are L-complete. These problems are known to be in P and in RNC for
general graphs, and in SPL for planar bipartite graphs [DKR08].
Our results settle the complexity of these problems for the class of k-trees.
The results are also applicable for bounded tree-width graphs, when a
tree-decomposition is given as input. The technique central to our algorithms
is a careful implementation of divide-and-conquer approach in log-space, along
with some ideas from [JT07] and [LMR07].Comment: Accepted in STACS 201
- …