• arXiv.cs.CC Pub Date : 2020-04-07
Christian Puchert; Andreas M. Tillmann

In recent years, several integer programming (IP) approaches were developed for maximum-likelihood decoding and minimum distance computation for binary linear codes. Two aspects in particular have been demonstrated to improve the performance of IP solvers as well as adaptive linear programming decoders: the dynamic generation of forbidden-set (FS) inequalities, a family of valid cutting planes, and

更新日期：2020-04-08
• arXiv.cs.CC Pub Date : 2020-04-03
Vijay V. Vazirani; Mihalis Yannakakis

In 1979, Hylland and Zeckhauser \cite{hylland} gave a simple and general scheme for implementing a one-sided matching market using the power of a pricing mechanism. Their method has nice properties -- it is incentive compatible in the large and produces an allocation that is Pareto optimal -- and hence it provides an attractive, off-the-shelf method for running an application involving such a market

更新日期：2020-04-06
• arXiv.cs.CC Pub Date : 2020-04-02
Arun U

The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually random (or whether it has some hidden undiscovered structure, which upon being detected would render it non-random). This has prevented the conclusive declaration

更新日期：2020-04-06
• arXiv.cs.CC Pub Date : 2020-04-03
Giorgio Ottaviani; Philipp Reichenbach

These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will be expressed in terms of tensor (border) rank, (border) symmetric rank and the asymptotic rank of certain tensors. We introduce the multilinear rank of a tensor

更新日期：2020-04-06
• arXiv.cs.CC Pub Date : 2019-02-10
Olivier Bousquet; Daniel Kane; Shay Moran

Consider the following problem: given two arbitrary densities $q_1,q_2$ and a sample-access to an unknown target density $p$, find which of the $q_i$'s is closer to $p$ in total variation. A remarkable result due to Yatracos shows that this problem is tractable in the following sense: there exists an algorithm that uses $O(\epsilon^{-2})$ samples from $p$ and outputs~$q_i$ such that with high probability

更新日期：2020-04-06
• arXiv.cs.CC Pub Date : 2019-04-02
Aleksejs Naumovs; Maksims Dimitrijevs; Abuzer Yakaryılmaz

It is known that 2-state binary and 3-state unary probabilistic finite automata and 2-state unary quantum finite automata recognize uncountably many languages with cutpoints. These results have been obtained by associating each recognized language with a cutpoint and then by using the fact that there are uncountably many cutpoints. In this note, we prove the same results for fixed cutpoints: each recognized

更新日期：2020-04-03
• arXiv.cs.CC Pub Date : 2020-03-29
Mrinal Kumar; Ben Lee Volk

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero $n^2$-variate polynomial $P \in \mathbb{F}(x_{1, 1}, \ldots, x_{n, n})$ of degree at most $\mathsf{poly}(n)$ such that every matrix $M$ which can be written as a sum of a matrix

更新日期：2020-03-31
• arXiv.cs.CC Pub Date : 2020-03-29
Dorit Aharonov; Alex B. Grilo

Despite the interest in the complexity class MA, the randomized analog of NP, there is just a couple of known natural (promise-)MA-complete problems, the first due to Bravyi and Terhal (SIAM Journal of Computing 2009) and the second due to Bravyi (Quantum Information and Computation 2015). Surprisingly, both problems are stated using terminology from quantum computation. This fact makes it hard for

更新日期：2020-03-31
• arXiv.cs.CC Pub Date : 2020-03-30
Thomas WorschKarlsruhe Institute of Technology

In cellular automata with multiple speeds for each cell $i$ there is a positive integer $p_i$ such that this cell updates its state still periodically but only at times which are a multiple of $p_i$. Additionally there is a finite upper bound on all $p_i$. Manzoni and Umeo have described an algorithm for these (one-dimensional) cellular automata which solves the Firing Squad Synchronization Problem

更新日期：2020-03-31
• arXiv.cs.CC Pub Date : 2018-09-06
Mark Bun; Robin Kothari; Justin Thaler

We give new quantum algorithms for evaluating composed functions whose inputs may be shared between bottom-level gates. Let $f$ be a Boolean function and consider a function $F$ obtained by applying $f$ to conjunctions of possibly overlapping subsets of $n$ variables. If $f$ has quantum query complexity $Q(f)$, we give an algorithm for evaluating $F$ using $\tilde{O}(\sqrt{Q(f) \cdot n})$ quantum queries

更新日期：2020-03-31
• arXiv.cs.CC Pub Date : 2019-06-24
Amir M. Ben-Amram; Geoff Hamilton

In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication - it is possible to decide precisely whether a program has certain growth-rate properties, in particular whether a computed value, or the program's running time, has a polynomial growth

更新日期：2020-03-31
• arXiv.cs.CC Pub Date : 2020-03-26
Dmitriy Zhuk

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constraints. In this paper we show that one of the most popular variants of the SCSP, called No-Rainbow Problem, is NP-Hard.

更新日期：2020-03-27
• arXiv.cs.CC Pub Date : 2020-03-24
Lintao Ye; Nathaniel Woodford; Sandip Roy; Shreyas Sundaram

Given a linear dynamical system affected by stochastic noise, we consider the problem of selecting an optimal set of sensors (at design-time) to minimize the trace of the steady state a priori or a posteriori error covariance of the Kalman filter, subject to certain selection budget constraints. We show the fundamental result that there is no polynomial-time constant-factor approximation algorithm

更新日期：2020-03-27
• arXiv.cs.CC Pub Date : 2020-03-26
Aris Filos-Ratsikas; Alexandros Hollender; Katerina Sotiraki; Manolis Zampetakis

The classes PPA-$p$ have attracted attention lately, because they are the main candidates for capturing the complexity of Necklace Splitting with $p$ thieves, for prime $p$. However, these classes are not known to have complete problems of a topological nature, which impedes any progress towards settling the complexity of the problem. On the contrary, such problems have been pivotal in obtaining completeness

更新日期：2020-03-27
• arXiv.cs.CC Pub Date : 2019-09-18
Renos Karamanis; Eleftherios Anastasiadis; Panagiotis Angeloudis; Marc Stettler

Transportation Network Companies employ dynamic pricing methods at periods of peak travel to incentivise driver participation and balance supply and demand for rides. Surge pricing multipliers are commonly used and are applied following demand and estimates of customer and driver trip valuations. Combinatorial double auctions have been identified as a suitable alternative, as they can achieve maximum

更新日期：2020-03-27
• arXiv.cs.CC Pub Date : 2019-11-04
Dmitry Gavinsky

A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.

更新日期：2020-03-27
• arXiv.cs.CC Pub Date : 2020-03-24
Tomoyuki Morimae

The posthoc verification protocol [J. F. Fitzsimons, M. Hajdu{\v s}ek, and T. Morimae, Physical Review Letters {\bf120}, 040501 (2018)] enables an information-theoretically-sound non-interactive verification of quantum computing, but the message from the prover to the verifier is quantum and the verifier has to do single-qubit measurements. The Mahadev protocol removes these quantum parts, but the

更新日期：2020-03-27
• arXiv.cs.CC Pub Date : 2020-03-25
Nina Chiarelli; Matjaž Krnc; Martin Milanič; Ulrich Pferschy; Nevena Pivač; Joachim Schauer

In this work we add a graph theoretical perspective to a classical problem of fairly allocating indivisible items to several agents. Agents have different profit valuations of items and we allow an incompatibility relation between pairs of items described in terms of a conflict graph. Hence, every feasible allocation of items to the agents corresponds to a partial coloring, that is, a collection of

更新日期：2020-03-26
• arXiv.cs.CC Pub Date : 2020-03-25
Andrei Krokhin; Jakub Opršal; Marcin Wrochna; Stanislav Živný

The approximate graph colouring problem concerns colouring a $k$-colourable graph with $c$ colours, where $c\geq k$. This problem naturally generalises to promise graph homomorphism and further to promise constraint satisfaction problems. Complexity analysis of all these problems is notoriously difficult. In this paper, we introduce two new techniques to analyse the complexity of promise CSPs: one

更新日期：2020-03-26
• arXiv.cs.CC Pub Date : 2020-03-20
Talley Amir; James Aspnes; David Doty; Mahsa Eftekhari H.; Eric Severson

The standard population protocol model assumes that when two agents interact, each observes the entire state of the other agent. We initiate the study of the $\textbf{message complexity}$ for population protocols, where the state of an agent is divided into an externally-visible $\textbf{message}$ and an internal component, where only the message can be observed by the other agent in an interaction

更新日期：2020-03-24
• arXiv.cs.CC Pub Date : 2020-03-22
Tianrong Lin

The whole discussions are divided into two parts, one is for $|\Sigma|\geq 2$ (general case), another is for $|\Sigma|=1$ (special case). The main contribution of the present paper is that a series of results are obtained. Specifically, we prove in general case that: (1) Let $L_1\in NP-P$ and $L_2\in P$, then the complexity of problem on reducibility from $L_1$ to $L_2$ is $\Omega(m^{p(|\omega|)})$

更新日期：2020-03-24
• arXiv.cs.CC Pub Date : 2020-03-22
Zachary RemscrimMIT

The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a 2QCFA with only a single-qubit can recognize the language $L_{pal}=\{w \in \{a,b\}^*:w \text{ is a palindrome}\}$ with bounded error in expected time $2^{O(n)}$

更新日期：2020-03-24
• arXiv.cs.CC Pub Date : 2020-03-22
Zachary RemscrimMIT


更新日期：2020-03-03
• arXiv.cs.CC Pub Date : 2016-08-11
Pavol Hell; Akbar Rafiey; Arash Rafiey

In this paper we study the class of bi-arc digraphs, important from two seemingly unrelated perspectives. On the one hand, they are precisely the digraphs that admit certain polymorphisms of interest in the study of constraint satisfaction problems; on the other hand, they are a very broad generalization of interval graphs. Bi-arc digraphs is the class of digraphs that admit conservative semilattice

更新日期：2020-03-03
Contents have been reproduced by permission of the publishers.

down
wechat
bug