Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
STACS
2016
Springer
4 years 10 months ago
Kernelization and Sparseness: the Case of Dominating Set
We prove that for every positive integer r and for every graph class G of bounded expansion, the r-Dominating Set problem admits a linear kernel on graphs from G. Moreover, in the...
Pål Grønås Drange, Markus Sortl...
STACS
2016
Springer
4 years 10 months ago
On Regularity of Unary Probabilistic Automata
The quantitative verification of Probabilistic Automata (PA) is undecidable in general. Unary PA are a simpler model where the choice of action is fixed. Still, the quantitative...
S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil ...
STACS
2016
Springer
4 years 10 months ago
Testing Shape Restrictions of Discrete Distributions
We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution D over [n] and a proper...
Clément L. Canonne, Ilias Diakonikolas, The...
STACS
2016
Springer
4 years 10 months ago
On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation
John Tromp introduced the so-called ’binary lambda calculus’ as a way to encode lambda terms in terms of 0−1-strings. Later, Grygiel and Lescanne conjectured that the number...
Bernhard Gittenberger, Zbigniew Golebiewski
STACS
2016
Springer
4 years 10 months ago
On a Fragment of AMSO and Tiling Systems
We prove that satisfiability over infinite words is decidable for a fragment of asymptotic monadic second-order logic. In this fragment we only allow formulae of the form ∃t...
Achim Blumensath, Thomas Colcombet, Pawel Parys
STACS
2016
Springer
4 years 10 months ago
Entropy Games and Matrix Multiplication Games
Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a...
Eugene Asarin, Julien Cervelle, Aldric Degorre, Ca...
STACS
2016
Springer
4 years 10 months ago
The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree
We consider the complexity of the Hamilton cycle decision problem when restricted to k-uniform hypergraphs H of high minimum codegree δ(H). We show that for tight Hamilton cycles...
Frederik Garbe, Richard Mycroft
STACS
2016
Springer
4 years 10 months ago
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits
We show an exponential separation between two well-studied models of algebraic computation, namely read-once oblivious algebraic branching programs (ROABPs) and multilinear depth ...
Neeraj Kayal, Vineet Nair, Chandan Saha
STACS
2016
Springer
4 years 10 months ago
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments
A tournament is a directed graph T such that every pair of vertices is connected by an arc. A feedback vertex set is a set S of vertices in T such that T −S is acyclic. In this ...
Mithilesh Kumar, Daniel Lokshtanov
books