Related papers: Parameterized Inapproximability Hypothesis under E…
We provide a new approach for establishing hardness of approximation results, based on the theory recently introduced by the author. It allows one to directly show that approximating a problem beyond a certain threshold requires…
We investigate the Constraint Satisfaction Problem (CSP) over templates with a group structure, and algorithms solving CSP that are equivariant, i.e. invariant under a natural group action induced by a template. Our main result is a method…
We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph $G$ to graph $H$ cannot be done in time $|V(H)|^{o(|V(G)|)}$. We also show an exponential-time reduction from Graph…
This paper develops an assume-guarantee (AG) framework for the compositional verification of probabilistic automata (PAs) with uncertain transition probabilities. We study parametric probabilistic automata (pPAs), where probabilities are…
We study the complexity of the parameterised counting constraint satisfaction problem: given a set of constraints over a set of variables and a positive integer $k$, how many ways are there to assign $k$ variables to 1 (and the others to 0)…
We prove that finding a $k$-edge induced subgraph is fixed-parameter tractable, thereby answering an open problem of Leizhen Cai. Our algorithm is based on several combinatorial observations, Gauss' famous \emph{Eureka} theorem [Andrews,…
We consider the problem of inferring the conditional independence graph (CIG) of a multivariate stationary dicrete-time Gaussian random process based on a finite length observation. Using information-theoretic methods, we derive a lower…
The single sensor probability hypothesis density (PHD) and cardinalized probability hypothesis density (CPHD) filters have been developed in the literature using the random finite set framework. The existing multisensor extensions of these…
The Clauser-Horne-Shimony-Holt (CHSH) inequality is a constraint that local theories must obey. Quantum Mechanics predicts a violation of this inequality in certain experimental settings. Treatments of this subject frequently make…
Ensuring the correctness of critical real-time systems, involving concurrent behaviours and timing requirements, is crucial. Timed automata extend finite-state automata with clocks, compared in guards and invariants with integer constants.…
The eigenstate thermalization hypothesis (ETH) insists that for nonintegrable systems each energy eigenstate accurately gives microcanonical expectation values for a class of observables. As a mechanism for ETH to hold, we show that the…
Motivated by the pervasiveness of strong inapproximability results for Max-CSPs, we introduce a relaxed notion of an approximate solution of a Max-CSP. In this relaxed version, loosely speaking, the algorithm is allowed to replace the…
We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The questions, which have been asked several…
We study the parameterized complexity of approximating the $k$-Dominating Set (DomSet) problem where an integer $k$ and a graph $G$ on $n$ vertices are given as input, and the goal is to find a dominating set of size at most $F(k) \cdot k$…
This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…
This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…
The Eigenstate Thermalization Hypothesis (ETH) provides a way to understand how an isolated quantum mechanical system can be approximated by a thermal density matrix. We find a class of operators in (1+1)-$d$ conformal field theories,…
This article explores the estimation of unknown parameters and reliability characteristics under the assumption that the lifetimes of the testing units follow an Inverted Exponentiated Pareto (IEP) distribution. Here, both point and…
In order to calculate the unobserved volatility in conditional heteroscedastic time series models, the natural recursive approximation is very often used. Following \cite{StraumannMikosch2006}, we will call the model \emph{invertible} if…
Bell's theorem asserts that no model that satisfies all of the plausible physical assumptions of outcome independence (OI), measurement independence (MI) and Parameter Independence (PI) can reproduce quantum mechanics. Here I find the…