• 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-02-28
Contents have been reproduced by permission of the publishers.

down
wechat
bug