当前期刊: arXiv - CS - Computational Complexity Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Complexity of Modification Problems for Best Match Graphs
    arXiv.cs.CC Pub Date : 2020-06-30
    David Schaller; Peter F. Stadler; Marc Hellmuth

    Best match graphs (BMGs) are vertex-colored directed graphs that were introduced to model the relationships of genes (vertices) from different species (colors) given an underlying evolutionary tree that is assumed to be unknown. In real-life applications, BMGs are estimated from sequence similarity data. Measurement noise and approximation errors therefore result in empirically determined graphs that

    更新日期:2020-07-01
  • Counting Homomorphisms to $K_4$-minor-free Graphs, modulo 2
    arXiv.cs.CC Pub Date : 2020-06-30
    Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Živný

    We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ to a fixed graph $H$. Faben and Jerrum [ToC'15] introduced an explicit criterion on the graph $H$ and conjectured that, if satisfied, the problem is solvable in polynomial time and, otherwise, the problem is complete for the complexity class $\oplus\mathrm{P}$ of parity problems. We verify their conjecture

    更新日期:2020-07-01
  • Ideal Membership Problem for Boolean Minority
    arXiv.cs.CC Pub Date : 2020-06-29
    Arpitha P. Bharathi; Monaldo Mastrolilli

    The Ideal Membership Problem (IMP) tests if an input polynomial $f\in \mathbb{F}[x_1,\dots,x_n]$ with coefficients from a field $\mathbb{F}$ belongs to a given ideal $I \subseteq \mathbb{F}[x_1,\dots,x_n]$. It is a well-known fundamental problem with many important applications, though notoriously intractable in the general case. In this paper we consider the IMP for polynomial ideals encoding combinatorial

    更新日期:2020-07-01
  • Computation Offloading in Multi-Access Edge Computing Networks: A Multi-Task Learning Approach
    arXiv.cs.CC Pub Date : 2020-06-29
    Bo Yang; Xuelin Cao; Joshua Bassey; Xiangfang Li; Timothy Kroecker; Lijun Qian

    Multi-access edge computing (MEC) has already shown the potential in enabling mobile devices to bear the computation-intensive applications by offloading some tasks to a nearby access point (AP) integrated with a MEC server (MES). However, due to the varying network conditions and limited computation resources of the MES, the offloading decisions taken by a mobile device and the computational resources

    更新日期:2020-06-30
  • The Generalized Independent and Dominating Set Problems on Unit Disk Graphs
    arXiv.cs.CC Pub Date : 2020-06-27
    Sangram K. Jena; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy

    In this article, we study a generalized version of the maximum independent set and minimum dominating set problems, namely, the maximum $d$-distance independent set problem and the minimum $d$-distance dominating set problem on unit disk graphs for a positive integer $d>0$. We first show that the maximum $d$-distance independent set problem and the minimum $d$-distance dominating set problem belongs

    更新日期:2020-06-30
  • Chroma Intra Prediction with attention-based CNN architectures
    arXiv.cs.CC Pub Date : 2020-06-27
    Marc Górriz; Saverio Blasi; Alan F. Smeaton; Noel E. O'Connor; Marta Mrak

    Neural networks can be used in video coding to improve chroma intra-prediction. In particular, usage of fully-connected networks has enabled better cross-component prediction with respect to traditional linear models. Nonetheless, state-of-the-art architectures tend to disregard the location of individual reference samples in the prediction process. This paper proposes a new neural network architecture

    更新日期:2020-06-30
  • Quantum Communication Complexity of Distribution Testing
    arXiv.cs.CC Pub Date : 2020-06-26
    Aleksandrs Belovs; Arturo Castellanos; François Le Gall; Guillaume Malod; Alexander A. Sherstov

    The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over $[n]$, and the goal is to decide whether their two distributions are equal, or are $\epsilon$-far apart in the $l_1$-distance. In the present paper we show that the

    更新日期:2020-06-29
  • Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs
    arXiv.cs.CC Pub Date : 2020-06-26
    Pjotr Buy; Andreas Galanis; Viresh Patel; Guus Regts

    We study the computational complexity of approximating the partition function of the ferromagnetic Ising model in the Lee-Yang circle of zeros given by $|\lambda|=1$, where $\lambda$ is the external field of the model. Complex-valued parameters for the Ising model are relevant for quantum circuit computations and phase transitions in statistical physics, but have also been key in the recent deterministic

    更新日期:2020-06-29
  • APX-Hardness and Approximation for the k-Burning Number Problem
    arXiv.cs.CC Pub Date : 2020-06-25
    Debajyoti Mondal; N. Parthiabn; V. Kavitha; Indra Rajasingh

    Consider an information diffusion process on a graph $G$ that starts with $k>0$ burnt vertices, and at each subsequent step, burns the neighbors of the currently burnt vertices, as well as $k$ other unburnt vertices. The \emph{$k$-burning number} of $G$ is the minimum number of steps $b_k(G)$ such that all the vertices can be burned within $b_k(G)$ steps. Note that the last step may have smaller than

    更新日期:2020-06-29
  • Training Convolutional ReLU Neural Networks in Polynomial Time: Exact Convex Optimization Formulations
    arXiv.cs.CC Pub Date : 2020-06-26
    Tolga Ergen; Mert Pilanci

    We study training of Convolutional Neural Networks (CNNs) with ReLU activations and introduce exact convex optimization formulations with a polynomial complexity with respect to the number of data samples, the number of neurons and data dimension. Particularly, we develop a convex analytic framework utilizing semi-infinite duality to obtain equivalent convex optimization problems for several CNN architectures

    更新日期:2020-06-29
  • Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems
    arXiv.cs.CC Pub Date : 2020-06-24
    Cyrus Rashtchian; David P. Woodruff; Hanlin Zhu

    We consider the general problem of learning about a matrix through vector-matrix-vector queries. These queries provide the value of $\boldsymbol{u}^{\mathrm{T}}\boldsymbol{M}\boldsymbol{v}$ over a fixed field $\mathbb{F}$ for a specified pair of vectors $\boldsymbol{u},\boldsymbol{v} \in \mathbb{F}^n$. To motivate these queries, we observe that they generalize many previously studied models, such as

    更新日期:2020-06-26
  • Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond
    arXiv.cs.CC Pub Date : 2020-06-24
    Anup Bhattacharya; Sourav Chakraborty; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar

    The disjointness problem - where Alice and Bob are given two subsets of $\{1, \dots, n\}$ and they have to check if their sets intersect - is a central problem in the world of communication complexity. While both deterministic and randomized communication complexities for this problem are known to be $\Theta(n)$, it is also known that if the sets are assumed to be drawn from some restricted set systems

    更新日期:2020-06-25
  • Hardness of Approximation of (Multi-)LCS over Small Alphabet
    arXiv.cs.CC Pub Date : 2020-06-24
    Amey Bhangale; Diptarka Chakraborty; Rajendra Kumar

    The problem of finding longest common subsequence (LCS) is one of the fundamental problems in computer science, which finds application in fields such as computational biology, text processing, information retrieval, data compression etc. It is well known that (decision version of) the problem of finding the length of a LCS of an arbitrary number of input sequences (which we refer to as Multi-LCS problem)

    更新日期:2020-06-25
  • Reduction From Non-Unique Games To Boolean Unique Games
    arXiv.cs.CC Pub Date : 2020-06-23
    Ronen Eldan; Dana Moshkovitz

    We reduce the problem of proving a "Boolean Unique Games Conjecture" (with gap 1-delta vs. 1-C*delta, for any C> 1, and sufficiently small delta>0) to the problem of proving a PCP Theorem for a certain non-unique game. In a previous work, Khot and Moshkovitz suggested an inefficient candidate reduction (i.e., without a proof of soundness). The current work is the first to provide an efficient reduction

    更新日期:2020-06-24
  • Symmetries, graph properties, and quantum speedups
    arXiv.cs.CC Pub Date : 2020-06-23
    Shalev Ben-David; Andrew M. Childs; András Gilyén; William Kretschmer; Supartha Podder; Daochen Wang

    Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: how symmetric must a function be before it cannot exhibit a large quantum speedup? In this work, we prove that hypergraph symmetries in the adjacency matrix model allow at most a polynomial separation between randomized and

    更新日期:2020-06-24
  • Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error
    arXiv.cs.CC Pub Date : 2020-06-22
    M. Utkan Gezer; A. C. Cem Say

    We study the capabilities of probabilistic finite-state machines that act as verifiers for certificates of language membership for input strings, in the regime where the verifiers are restricted to toss some fixed nonzero number of coins regardless of the input size. Say and Yakary{\i}lmaz showed that the class of languages that could be verified by these machines within an error bound strictly less

    更新日期:2020-06-23
  • Efficiently generating ground states is hard for postselected quantum computation
    arXiv.cs.CC Pub Date : 2020-06-22
    Yuki Takeuchi; Yasuhiro Takahashi; Seiichiro Tani

    Although quantum computing is expected to outperform universal classical computing, an unconditional proof of this assertion seems to be hard because an unconditional separation between ${\sf BQP}$ and ${\sf BPP}$ implies ${\sf P}\neq{\sf PSPACE}$. Because of this, the quantum-computational-supremacy approach has been actively studied; it shows that if the output probability distributions from a family

    更新日期:2020-06-23
  • Constructing Driver Hamiltonians for Several Linear Constraints
    arXiv.cs.CC Pub Date : 2020-06-22
    Hannes Leipold; Federico M. Spedalieri

    Recent advances in the field of adiabatic quantum computing and the closely related field of quantum annealers has centered around using more advanced and novel Hamiltonian representations to solve optimization problems. One of these advances has centered around the development of driver Hamiltonians that commute with the constraints of an optimization problem - allowing for another avenue to satisfying

    更新日期:2020-06-23
  • Full complexity classification of the list homomorphism problem for bounded-treewidth graphs
    arXiv.cs.CC Pub Date : 2020-06-19
    Karolina Okrasa; Marta Piecyk; Paweł Rzążewski

    A homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$. Let $H$ be a fixed graph with possible loops. In the list homomorphism problem, denoted by LHom($H$), we are given a graph $G$, whose every vertex $v$ is assigned with a list $L(v)$ of vertices of $H$. We ask whether there exists a homomorphism $h$ from $G$ to $H$, which respects lists $L$, i.e., for

    更新日期:2020-06-22
  • When Is Amplification Necessary for Composition in Randomized Query Complexity?
    arXiv.cs.CC Pub Date : 2020-06-19
    Shalev Ben-David; Mika Göös; Robin Kothari; Thomas Watson

    Suppose we have randomized decision trees for an outer function $f$ and an inner function $g$. The natural approach for obtaining a randomized decision tree for the composed function $(f\circ g^n)(x^1,\ldots,x^n)=f(g(x^1),\ldots,g(x^n))$ involves amplifying the success probability of the decision tree for $g$, so that a union bound can be used to bound the error probability over all the coordinates

    更新日期:2020-06-22
  • Common equivalence and size after forgetting
    arXiv.cs.CC Pub Date : 2020-06-19
    Paolo Liberatore

    Forgetting variables from a propositional formula may increase its size. Introducing new variables is a way to shorten it. Both operations can be expressed in terms of common equivalence, a weakened version of equivalence. In turn, common equivalence can be expressed in terms of forgetting. An algorithm for forgetting and checking common equivalence in polynomial space is given for the Horn case; it

    更新日期:2020-06-22
  • On the complexity of detecting hazards
    arXiv.cs.CC Pub Date : 2020-06-18
    Balagopal Komarath; Nitin Saurabh

    Detecting and eliminating logic hazards in Boolean circuits is a fundamental problem in logic circuit design. We show that there is no $O(3^{(1-\epsilon)n} \text{poly}(s))$ time algorithm, for any $\epsilon > 0$, that detects logic hazards in Boolean circuits of size $s$ on $n$ variables under the assumption that the strong exponential time hypothesis is true. This lower bound holds even when the input

    更新日期:2020-06-19
  • Parameterized Inapproximability of Independent Set in $H$-Free Graphs
    arXiv.cs.CC Pub Date : 2020-06-18
    Pavel Dvořák; Andreas Emil Feldmann; Ashutosh Rai; Paweł Rzążewski

    We study the Independent Set (IS) problem in $H$-free graphs, i.e., graphs excluding some fixed graph $H$ as an induced subgraph. We prove several inapproximability results both for polynomial-time and parameterized algorithms. Halld\'orsson [SODA 1995] showed that for every $\delta>0$ IS has a polynomial-time $(\frac{d-1}{2}+\delta)$-approximation in $K_{1,d}$-free graphs. We extend this result by

    更新日期:2020-06-19
  • Political Advertising Dataset: the use case of the Polish 2020 Presidential Elections
    arXiv.cs.CC Pub Date : 2020-06-17
    Łukasz Augustyniak; Krzysztof Rajda; Tomasz Kajdanowicz; Michał Bernaczyk

    Political campaigns are full of political ads posted by candidates on social media. Political advertisements constitute a basic form of campaigning, subjected to various social requirements. We present the first publicly open dataset for detecting specific text chunks and categories of political advertising in the Polish language. It contains 1,705 human-annotated tweets tagged with nine categories

    更新日期:2020-06-19
  • Playing Unique Games on Certified Small-Set Expanders
    arXiv.cs.CC Pub Date : 2020-06-17
    Mitali Bafna; Boaz Barak; Pravesh Kothari; Tselil Schramm; David Steurer

    We give an algorithm for solving unique games (UG) instances whose constraints correspond to edges of graphs with a sum-of-squares (SoS) small-set-expansion certificate. As corollaries, we obtain the first polynomial-time algorithms for solving UG on the noisy hypercube and the short code graphs. The prior best algorithm for such instances was the eigenvalue enumeration algorithm of Arora, Barak, and

    更新日期:2020-06-18
  • On the Hardness of Problems Involving Negator Relationships in an Artificial Hormone System
    arXiv.cs.CC Pub Date : 2020-06-16
    Eric Hutter; Mathias Pacher; Uwe Brinkschulte

    The Artificial Hormone System (AHS) is a self-organizing middleware to allocate tasks in a distributed system. We extended it by so-called negator hormones to enable conditional task structures. However, this extension increases the computational complexity of seemingly simple decision problems in the system: In [1] and [2], we defined the problems Negator-Path and Negator-Sat and proved their NP-completeness

    更新日期:2020-06-16
  • Computing Igusa's local zeta function of univariates in deterministic polynomial-time
    arXiv.cs.CC Pub Date : 2020-06-16
    Ashish Dwivedi; Nitin Saxena

    Igusa's local zeta function $Z_{f,p}(s)$ is the generating function that counts the number of integral roots, $N_{k}(f)$, of $f(\mathbf x) \bmod p^k$, for all $k$. It is a famous result, in analytic number theory, that $Z_{f,p}$ is a rational function in $\mathbb{Q}(p^s)$. We give an elementary proof of this fact for a univariate polynomial $f$. Our proof is constructive as it gives a closed-form expression

    更新日期:2020-06-16
  • Exact and Metaheuristic Approaches for the Production Leveling Problem
    arXiv.cs.CC Pub Date : 2020-06-15
    Johannes Vass; Marie-Louise Lackner; Nysret Musliu

    In this paper we introduce a new problem in the field of production planning which we call the Production Leveling Problem. The task is to assign orders to production periods such that the load in each period and on each production resource is balanced, capacity limits are not exceeded and the orders' priorities are taken into account. Production Leveling is an important intermediate step between long-term

    更新日期:2020-06-15
  • Algorithmically Optimal Outer Measures
    arXiv.cs.CC Pub Date : 2020-06-15
    Jack H. Lutz; Neil Lutz

    We investigate the relationship between algorithmic fractal dimensions and the classical local fractal dimensions of outer measures in Euclidean spaces. We introduce global and local optimality conditions for lower semicomputable outer measures. We prove that globally optimal outer measures exist. Our main theorem states that the classical local fractal dimensions of any locally optimal outer measure

    更新日期:2020-06-15
  • Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests
    arXiv.cs.CC Pub Date : 2020-06-15
    Janaky Murthy; Vineet Nair; Chandan Saha

    Equivalence testing for a polynomial family {g_m} over a field F is the following problem: Given black-box access to an n-variate polynomial f(x), where n is the number of variables in g_m, check if there exists an A in GL(n,F) such that f(x) = g_m(Ax). If yes, then output such an A. The complexity of equivalence testing has been studied for a number of important polynomial families, including the

    更新日期:2020-06-15
  • The PSPACE-hardness of understanding neural circuits
    arXiv.cs.CC Pub Date : 2020-06-15
    Vidya Sagar Sharma; Piyush Srivastava

    In neuroscience, an important aspect of understanding the function of a neural circuit is to determine which, if any, of the neurons in the circuit are vital for the biological behavior governed by the neural circuit. A similar problem is to determine whether a given small set of neurons may be enough for the behavior to be displayed, even if all other neurons in the circuit are deactivated. Such a

    更新日期:2020-06-15
  • Polynomial time deterministic identity testingalgorithm for $Σ^{[3]}ΠΣΠ^{[2]}$ circuits via Edelstein-Kelly type theorem for quadratic polynomials
    arXiv.cs.CC Pub Date : 2020-06-15
    Shir Peleg; Amir Shpilka

    In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS13] and Gupta [Gup14], by proving an analog of a theorem of Edelstein and Kelly for quadratic polynomials. As immediate corollary we obtain the first deterministic polynomial time black-box algorithm for testing zeroness of $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$ circuits.

    更新日期:2020-06-15
  • Improved algorithm for permutation testing
    arXiv.cs.CC Pub Date : 2020-06-15
    Xiaojin Zhang

    We study the problem of testing forbidden patterns. The patterns that are of significant interest include monotone pattern and $(1,3,2)$-pattern. For the problem of testing monotone patterns, \cite{newman2019testing} propose a non-adaptive algorithm with query complexity $(\log n)^{O(k^2)}$. \cite{ben2019finding} then improve the query complexity of non-adaptive algorithm to $\Omega((\log n)^{\lfloor\log

    更新日期:2020-06-15
  • Oblivious and Semi-Oblivious Boundedness for Existential Rules
    arXiv.cs.CC Pub Date : 2020-06-15
    Pierre Bourhis; Michel Leclère; Marie-Laure Mugnier; Sophie Tison; Federico Ulliana; Lily Galois

    We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on the oblivious and the semi-oblivious chase variants, we give a characterization of boundedness in terms of FO-rewritability and chase termination. We show that it

    更新日期:2020-06-15
  • Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games
    arXiv.cs.CC Pub Date : 2020-06-15
    Kristoffer Arnsfelt Hansen; Steffan Christ Sølvsten

    We show that the problem of deciding whether in a multi-player perfect information recursive game (i.e. a stochastic game with terminal rewards) there exists a stationary Nash equilibrium ensuring each player a certain payoff is Existential Theory of the Reals complete. Our result holds for acyclic games, where a Nash equilibrium may be computed efficiently by backward induction, and even for deterministic

    更新日期:2020-06-15
  • Derivative-free global minimization for a class of multiple minima problems
    arXiv.cs.CC Pub Date : 2020-06-15
    Xiaopeng Luo; Xin Xu; Daoyi Dong

    We prove that the finite-difference based derivative-free descent (FD-DFD) methods have a capability to find the global minima for a class of multiple minima problems. Our main result shows that, for a class of multiple minima objectives that is extended from strongly convex functions with Lipschitz-continuous gradients, the iterates of FD-DFD converge to the global minimizer $x_*$ with the linear

    更新日期:2020-06-15
  • Special-case Algorithms for Blackbox Radical Membership, Nullstellensatz and Transcendence Degree
    arXiv.cs.CC Pub Date : 2020-06-13
    Abhibhav Garg; Nitin Saxena

    Radical membership testing, and the special case of Hilbert's Nullstellensatz (HN), is a fundamental computational algebra problem. It is NP-hard; and has a famous PSPACE algorithm due to effective Nullstellensatz bounds. We identify a useful case of these problems where practical algorithms, and improved bounds, could be given, when the transcendence degree $r$ of the input polynomials is smaller

    更新日期:2020-06-13
  • On the Skolem Problem and Prime Powers
    arXiv.cs.CC Pub Date : 2020-06-12
    George Kenison; Richard Lipton; Joël Ouaknine; James Worrell

    The Skolem Problem asks, given a linear recurrence sequence $(u_n)$, whether there exists $n\in\mathbb{N}$ such that $u_n=0$. In this paper we consider the following specialisation of the problem: given in addition $c\in\mathbb{N}$, determine whether there exists $n\in\mathbb{N}$ of the form $n=lp^k$, with $k,l\leq c$ and $p$ any prime number, such that $u_n=0$.

    更新日期:2020-06-12
  • Quantum-over-classical Advantage in Solving Multiplayer Games
    arXiv.cs.CC Pub Date : 2020-06-12
    Dmitry Kravchenko; Kamil Khadiev; Danil Serov; Ruslan Kapralov

    We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction games became the first explicitly defined class of zero-sum combinatorial games with provable separation between quantum and classical complexity of solving them

    更新日期:2020-06-12
  • Interpreting CNN for Low Complexity Learned Sub-pixel Motion Compensation in Video Coding
    arXiv.cs.CC Pub Date : 2020-06-11
    Luka Murn; Saverio Blasi; Alan F. Smeaton; Noel E. O'Connor; Marta Mrak

    Deep learning has shown great potential in image and video compression tasks. However, it brings bit savings at the cost of significant increases in coding complexity, which limits its potential for implementation within practical applications. In this paper, a novel neural network-based tool is presented which improves the interpolation of reference samples needed for fractional precision motion compensation

    更新日期:2020-06-11
  • Tight Quantum Time-Space Tradeoffs for Function Inversion
    arXiv.cs.CC Pub Date : 2020-06-10
    Kai-Min Chung; Siyao Guo; Qipeng Liu; Luowen Qian

    In function inversion, we are given a function $f: [N] \mapsto [N]$, and want to prepare some advice of size $S$, such that we can efficiently invert any image in time $T$. This is a well studied problem with profound connections to cryptography, data structures, communication complexity, and circuit lower bounds. Investigation of this problem in the quantum setting was initiated by Nayebi, Aaronson

    更新日期:2020-06-10
  • Reliable Detection for Spatial Modulation Systems
    arXiv.cs.CC Pub Date : 2020-06-09
    Ibrahim Al-Nahhal; Octavia A. Dobre; Salama Ikki

    Spatial modulation (SM) is a promising multiple-input multiple-output system used to increase spectral efficiency. The maximum likelihood (ML) decoder jointly detects the transmitted SM symbol, which is of high complexity. In this paper, a novel reliable sphere decoder (RSD) algorithm based on tree-search is proposed for the SM system. The basic idea of the proposed RSD algorithm is to reduce the size

    更新日期:2020-06-09
  • Quantum Logspace Algorithm for Powering Matrices with Bounded Norm
    arXiv.cs.CC Pub Date : 2020-06-08
    Uma Girish; Ran Raz; Wei Zhan

    We give a quantum logspace algorithm for powering contraction matrices, that is, matrices with spectral norm at most~1. The algorithm gets as an input an arbitrary $n\times n$ contraction matrix $A$, and a parameter $T \leq \mathrm{poly}(n)$ and outputs the entries of $A^T$, up to (arbitrary) polynomially small additive error. The algorithm applies only unitary operators, without intermediate measurements

    更新日期:2020-06-08
  • Evaluation of Quantum Approximate Optimization Algorithm based on the approximation ratio of single samples
    arXiv.cs.CC Pub Date : 2020-06-08
    Jason Larkin; Matías Jonsson; Daniel Justice; Gian Giacomo Guerreschi

    The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm to solve binary-variable optimization problems. Due to its expected robustness to systematic errors and the short circuit depth, it is one of the promising candidates likely to run on near-term quantum devices. We project the performance of QAOA applied to the Max-Cut problem and compare it with some of the

    更新日期:2020-06-08
  • Quantum Legendre-Fenchel Transform
    arXiv.cs.CC Pub Date : 2020-06-08
    David Sutter; Giacomo Nannicini; Tobias Sutter; Stefan Woerner

    We present a quantum algorithm to compute the discrete Legendre-Fenchel transform. Given access to a convex function evaluated at $N$ points, the algorithm outputs a quantum-mechanical representation of its corresponding discrete Legendre-Fenchel transform evaluated at $K$ points in the transformed space. For a fixed regular discretizaton of the dual space the expected running time scales as $O(\sqrt{\kappa}\

    更新日期:2020-06-08
  • An Optimal Tester for $k$-Linear
    arXiv.cs.CC Pub Date : 2020-06-08
    Nader H. Bshouty

    A Boolean function $f:\{0,1\}^n\to \{0,1\}$ is $k$-linear if it returns the sum (over the binary field $F_2$) of $k$ coordinates of the input. In this paper, we study property testing of the classes $k$-Linear, the class of all $k$-linear functions, and $k$-Linear$^*$, the class $\cup_{j=0}^kj$-Linear. We give a non-adaptive distribution-free two-sided $\epsilon$-tester for $k$-Linear that makes $$O\left(k\log

    更新日期:2020-06-08
  • PSPACE-completeness of Pulling Blocks to Reach a Goal
    arXiv.cs.CC Pub Date : 2020-06-08
    Joshua Ani; Sualeh Asif; Erik D. Demaine; Yevhenii Diomidov; Dylan Hendrickson; Jayson Lynch; Sarah Scheffler; Adam Suhl

    We prove PSPACE-completeness of all but one problem in a large space of pulling-block problems where the goal is for the agent to reach a target destination. The problems are parameterized by whether pulling is optional, the number of blocks which can be pulled simultaneously, whether there are fixed blocks or thin walls, and whether there is gravity. We show NP-hardness for the remaining problem,

    更新日期:2020-06-08
  • A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
    arXiv.cs.CC Pub Date : 2020-06-08
    Andreas Emil Feldmann; Karthik C. S.; Euiwoong Lee; Pasin Manurangsi

    Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions.

    更新日期:2020-06-08
  • Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem
    arXiv.cs.CC Pub Date : 2020-06-08
    Amal Benhamiche; Morgan Chopin

    In this paper, we consider the Delay Constrained Unsplittable Shortest Path Routing problem which arises in the field of traffic engineering for IP networks. This problem consists, given a directed graph and a set of commodities, to compute a set of routing paths and the associated administrative weights such that each commodity is routed along the unique shortest path between its origin and its destination

    更新日期:2020-06-08
  • The Continuous Joint Replenishment Problem is Strongly NP-Hard
    arXiv.cs.CC Pub Date : 2020-06-07
    Alexander Tuisov; Liron Yedidsion

    The Continuous Periodic Joint Replenishment Problem (CPJRP) has been one of the core and most studied problems in supply chain management for the last half a century. Nonetheless, despite the vast effort put into studying the problem, its complexity has eluded researchers for years. Although the CPJRP has one of the tighter constant approximation ratio of 1.02, a polynomial optimal solution to it was

    更新日期:2020-06-07
  • On the Complexity of Branching Proofs
    arXiv.cs.CC Pub Date : 2020-06-07
    Daniel Dadush; Samarth Tiwari

    We consider the task of proving integer infeasibility of a bounded convex $K$ in $\mathbb{R}^n$ using a general branching proof system. In a general branching proof, one constructs a branching tree by adding an integer disjunction $\mathbf{a} \mathbf{x} \leq b$ or $\mathbf{a} \mathbf{x} \geq b+1$, $\mathbf{a} \in \mathbb{Z}^n$, $b \in \mathbb{Z}$, at each node, such that the leaves of the tree correspond

    更新日期:2020-06-07
  • On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes
    arXiv.cs.CC Pub Date : 2020-06-06
    Arman Boyacı; Tınaz Ekim; Mordechai Shalom

    Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this paper, we give FPT algorithms for the maximum cardinality cut problem in classes of graphs containing proper interval graphs and mixed unit interval graphs when parameterized by some new parameters that

    更新日期:2020-06-06
  • VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints
    arXiv.cs.CC Pub Date : 2020-06-05
    Arnaud Casteigts; Mathieu Raffinot; Jason Schoeters

    We study a new version of the Euclidean TSP called VectorTSP (VTSP for short) where a mobile entity is allowed to move according to a set of physical constraints inspired from the pen-and-pencil game Racetrack (also known as Vector Racer ). In contrast to other versions of TSP accounting for physical constraints, such as Dubins TSP, the spirit of this model is that (1) no speed limitations apply, and

    更新日期:2020-06-05
  • Eliminating Intermediate Measurements in Space-Bounded Quantum Computation
    arXiv.cs.CC Pub Date : 2020-06-05
    Bill FeffermanUniversity of Chicago; Zachary RemscrimMIT

    A foundational result in the theory of quantum computation known as the "principle of safe storage" shows that it is always possible to take a quantum circuit and produce an equivalent circuit that makes all measurements at the end of the computation. While this procedure is time efficient, meaning that it does not introduce a large overhead in the number of gates, it uses extra ancillary qubits and

    更新日期:2020-06-05
  • Clique-Width: Harnessing the Power of Atoms
    arXiv.cs.CC Pub Date : 2020-06-05
    Konrad K. Dabrowski; Tomáš Masařík; Jana Novotná; Daniël Paulusma; Paweł Rzążewski

    Many NP-complete graph problems are polynomially solvable on graph classes of bounded clique-width. Several of these problems are polynomially solvable on a hereditary graph class G if they are so on the atoms (graphs with no clique cut-set) of G. Hence, we initiate a systematic study into boundedness of clique-width of atoms of hereditary graph classes. A graph G is H-free if H is not an induced subgraph

    更新日期:2020-06-05
  • Single-machine scheduling with an external resource
    arXiv.cs.CC Pub Date : 2020-06-05
    Dirk Briskorn; Morteza Davari; Jannik Matuschke

    This paper studies the complexity of single-machine scheduling with an external resource, which is rented for a non-interrupted period. Jobs that need this external resource are executed only when the external resource is available. There is a cost associated with the scheduling of jobs and a cost associated with the duration of the renting period of the external resource. We look at three classes

    更新日期:2020-06-05
  • Hardness of Learning Neural Networks with Natural Weights
    arXiv.cs.CC Pub Date : 2020-06-05
    Amit Daniely; Gal Vardi

    Neural networks are nowadays highly successful despite strong hardness results. The existing hardness results focus on the network architecture, and assume that the network's weights are arbitrary. A natural approach to settle the discrepancy is to assume that the network's weights are "well-behaved" and posses some generic properties that may allow efficient learning. This approach is supported by

    更新日期:2020-06-05
  • On subset sum problem in branch groups
    arXiv.cs.CC Pub Date : 2020-06-04
    Andrey Nikolaev; Alexander Ushakov

    We consider a group-theoretic analogue of the classic subset sum problem. In this brief note, we show that the subset sum problem is NP-complete in the first Grigorchuk group. More generally, we show NP-hardness of that problem in weakly regular branch groups, which implies NP-completeness if the group is, in addition, contracting.

    更新日期:2020-06-04
  • On tensor rank and commuting matrices
    arXiv.cs.CC Pub Date : 2020-06-03
    Pascal Koiran

    Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his $3n/2$ border rank lower bound. Our approach revolves around a problem on commuting matrices: Given matrices $Z_1,...,Z_p$ of size $n$ and an integer $r>n$, are there commuting matrices $Z'_1,...,Z'_p$ of size

    更新日期:2020-06-03
  • On a Class of Constrained Synchronization Problems in NP
    arXiv.cs.CC Pub Date : 2020-06-02
    Stefan Hoffmann

    The class of known constraint automata for which the constrained synchronization problem is in NP all admit a special form. In this work, we take a closer look at them. We characterize a wider class of constraint automata that give constrained synchronization problems in NP, which encompasses all known problems in NP. We call these automata polycyclic automata. The corresponding language class of polycyclic

    更新日期:2020-06-02
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
自然科研论文编辑服务
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
鲁照永
复旦大学
苏州大学
南京工业大学
南开大学
中科大
唐勇
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
广东实验室
南京大学
陈永胜
南科大
刘尊峰
湖南大学
清华大学
王小野
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug