当前期刊: Journal of Computer and System Sciences Go to current issue    加入关注    本刊投稿指南
显示样式:        排序: IF: - GO 导出
  • Counting subset repairs with functional dependencies
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-11-26
    Ester Livshits; Benny Kimelfeld; Jef Wijsen

    We study the problem of counting the repairs of an inconsistent database in the case where constraints are Functional Dependencies (FDs). A repair is then a maximal independent set of the conflict graph, wherein nodes represent facts and edges represent violations. We establish a dichotomy in data complexity for the complete space of FDs: when the FD set has, up to equivalence, what we call a “left-hand-side

  • On the profits of competing cloud service providers: A game theoretic approach
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-11-20
    Keqin Li

    The main contributions of the paper are summarized as follows. We take an analytical approach in the sense that the quality of service and the price of service as well as the revenue, cost, and profit of a cloud service provider (CSP) can all be quantitatively available based on well established analytical models. We argue that the satisfaction of a customer includes two aspects, i.e., satisfaction

  • Selective monitoring
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-11-18
    Radu Grigore; Stefan Kiefer

    We study selective monitors for labelled Markov chains. Monitors observe the outputs that are generated by a Markov chain during its run, with the goal of identifying runs as correct or faulty. A monitor is selective if it skips observations in order to reduce monitoring overhead. We are interested in monitors that minimize the expected number of observations. We establish an undecidability result

  • Uniform Parsing for Hyperedge Replacement Grammars
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-11-27
    Henrik Björklund; Frank Drewes; Petter Ericson; Florian Starke

    It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even under seemingly harsh restrictions. This means that the parsing problem is difficult even in the non-uniform setting, in which the grammar is considered to be fixed rather than being part of the input. Little is known about restrictions under which truly uniform polynomial parsing is possible. In this

  • Parameterized k-Clustering: Tractability island
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-11-19
    Fedor V. Fomin; Petr A. Golovach; Kirill Simonov

    In k-Clustering we are given a multiset of n vectors X⊂Zd and a nonnegative number D, and we need to decide whether X can be partitioned into k clusters C1,…,Ck such that the cost∑i=1kminci∈Rd⁡∑x∈Ci‖x−ci‖pp≤D, where ‖⋅‖p is the Lp-norm. For p=2, k-Clustering is k-Means. We study k-Clustering from the perspective of parameterized complexity. The problem is known to be NP-hard for k=2 and also for d=2

  • Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-11-19
    Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos; Paul G. Spirakis

    We study the problem of finding an exact solution to the Consensus Halving problem. While recent work has shown that the approximate version of this problem is PPA -complete [29], [30], we show that the exact version is much harder. Specifically, finding a solution with n agents and n cuts is FIXP -hard, and deciding whether there exists a solution with fewer than n cuts is ETR -complete. Along the

  • Block trees
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-11-18
    Djamal Belazzougui; Manuel Cáceres; Travis Gagie; Paweł Gawrychowski; Juha Kärkkäinen; Gonzalo Navarro; Alberto Ordóñez; Simon J. Puglisi; Yasuo Tabei

    Let string S[1..n] be parsed into z phrases by the Lempel-Ziv algorithm. The corresponding compression algorithm encodes S in O(z) space, but it does not support random access to S. We introduce a data structure, the block tree, that represents S in O(zlog⁡(n/z)) space and extracts any symbol of S in time O(log⁡(n/z)), among other space-time tradeoffs. The structure also supports other queries that

  • Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-11-18
    Victor Lagerkvist; Biman Roy

    The inverse satisfiability problem over a set of relations Γ (Inv-SAT(Γ)) is the problem of deciding whether a relation R can be defined as the set of models of a SAT(Γ) instance. Kavvadias and Sideri (1998) [15] obtained a dichotomy between P and co-NP-complete for finite Γ containing the two constant Boolean relations. However, for arbitrary constraint languages the complexity has been wide open

  • On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-11-18
    Ioannis Caragiannis; Angelo Fanelli

    We consider weighted congestion games with polynomial latency functions of maximum degree d≥1. For these games, we investigate the existence and efficiency of approximate pure Nash equilibria which are obtained through sequences of unilateral improvement moves by the players. By exploiting a simple technique, we firstly show that these games admit an infinite set of d-approximate potential functions

  • Speeding-up verification of digital signatures
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-09-25
    Abdul Rahman Taleb; Damien Vergnaud

    In 2003, Fischlin introduced the concept of progressive verification in cryptography to relate the error probability of a cryptographic verification procedure to its running time. It ensures that the verifier confidence in the validity of a verification procedure grows with the work it invests in the computation. Le, Kelkar and Kate recently revisited this approach for digital signatures and proposed

  • Equivalence checking of quantum finite-state machines
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-09-17
    Qisheng Wang; Junyi Liu; Mingsheng Ying

    In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for checking equivalence of two machines. As an application, they are used in equivalence checking of quantum circuits. Moreover, the minimisation problem is proved

  • Largest Common Prefix of a Regular Tree Language
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-09-17
    Markus Lohrey; Sebastian Maneth

    A family of tree automata of size n is presented such that the size of the largest common prefix (lcp) tree of all accepted trees is exponential in n. Moreover, it is shown that this prefix tree is not compressible via DAGs (directed acyclic graphs) or tree straight-line programs. We also show that determining whether or not the lcp trees of two given tree automata are equal is coNP-complete; the result

  • On the Fast Delivery Problem with One or Two Packages
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-09-17
    Iago A. Carvalho; Thomas Erlebach; Kleitos Papadopoulos

    We study two problems where k autonomous mobile agents are initially located on distinct nodes of a weighted graph with n nodes and m edges. Each agent has a predefined velocity and can only move along the edges of the graph. The first problem is to deliver one package from a source node to a destination node. The second is to simultaneously deliver two packages, each from its source node to its destination

  • Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-08-27
    Andreas Galanis, Leslie Ann Goldberg, Kuan Yang

    We study the complexity of #CSPΔ(Γ), which is the problem of counting satisfying assignments to CSP instances with constraints from Γ and whose variables can appear at most Δ times. Our main result shows that: (i) if every function in Γ is affine, then #CSPΔ(Γ) is in FP for all Δ, (ii) otherwise, if every function in Γ is in a class called IM2, then for large Δ, #CSPΔ(Γ) is equivalent under approximation-preserving

  • Preimage problems for deterministic finite automata
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-08-21
    Mikhail V. Berlinkov, Robert Ferens, Marek Szykuła

    Given a subset of states S of a deterministic finite automaton and a word w, the preimage is the subset of all states mapped to a state in S by the action of w. We study three natural problems concerning words giving certain preimages. The first problem is whether, for a given subset, there exists a word extending the subset (giving a larger preimage). The second problem is whether there exists a totally

  • Assigning times to minimise reachability in temporal graphs
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-08-20
    Jessica Enright, Kitty Meeks, Fiona Skerman

    Temporal graphs (in which edges are active at specified times) are of particular relevance for spreading processes on graphs, e.g. the spread of disease or dissemination of information. Motivated by real-world applications, modification of static graphs to control this spread has proven a rich topic for previous research. Here, we introduce a new type of modification for temporal graphs: the number

  • Deterministic protocols in the SINR model without knowledge of coordinates
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-08-12
    William K. Moses Jr., Shailesh Vaya

    This work studies multi-broadcasting for the SINR (Signal-to-Interference-plus-Noise-Ratio) model, assuming a subset of nodes are initially awake, when each device only has access to knowledge about the total number of nodes in the network n, the range from which each node's label is taken {1,…,N}, and the label of the device itself. We assume no knowledge of the physical coordinates of devices and

  • Understanding PPA-completeness
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-08-06
    Xiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, Zeying Xu

    We show that computation of the SPERNER problem is PPA-complete on the Möbius band under proper boundary conditions, settling a long term open problem. Further, the same computational complexity results extend to other discrete fixed points on the Möbius band, such as the Brouwer fixed point problem, the DPZP fixed point problem and a simple version of the Tucker problem, as well as the projective

  • Deciding the point-to-fixed-point problem for skew tent maps on an interval
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-08-06
    Bart Kuijpers

    We consider a family of skew tent maps fa on the unit interval, determined by the parameter a, with 0

  • Equivalence of pushdown automata via first-order grammars
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-07-29
    Petr Jančar

    A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by Sénizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for deterministic pushdown automata. The presented proof is conceptually simpler, and a particular novelty is that it is not given as two semidecision procedures but it provides

  • Circular pattern matching with k mismatches
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-07-29
    Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba

    We consider the circular pattern matching with k mismatches (k-CPM) problem in which one is to compute the minimal Hamming distance of every length-m substring of T and any cyclic rotation of P, if this distance is no more than k. It is a variation of the well-studied k-mismatch problem. A multitude of papers has been devoted to solving the k-CPM problem, but only average-case upper bounds are known

  • Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-07-23
    Shuang Zhao, Zongqing Chen, Weihua Yang, Jixiang Meng

    Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph G is maximally edge-connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. The edge fault-tolerance of the maximally-λ (resp

  • Attack and defense in the layered cyber-security model and their (1 ± ϵ)-approximation schemes
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-07-21
    Supachai Mukdasanit, Sanpawat Kantabutra

    Let M=(T,C,P) be a security model, where T is a rooted tree, C is a multiset of costs and P is a multiset of prizes and let (T,c,p) be a security system, where c and p are bijections of costs and prizes. The problems of computing an optimal attack on a security system and of determining an edge e∈E(T) such that the maximum sum of prizes obtained from an optimal attack in (T,c,p) is minimized when c(e)=∞

  • Searching by heterogeneous agents
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-07-17
    Dariusz Dereniowski, Łukasz Kuszner, Robert Ostrowski

    In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for

  • Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-07-15
    Benedikt Bollig, Marie Fortin, Paul Gastin

    Message sequence charts (MSCs) naturally arise as executions of communicating finite-state machines (CFMs), in which finite-state processes exchange messages through unbounded FIFO channels. We study the first-order logic of MSCs, featuring Lamport's happened-before relation. To this end, we introduce a star-free version of propositional dynamic logic (PDL) with loop and converse. Our main results

  • Space efficient representations of finite groups
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-07-09
    Bireswar Das, Shivdutt Sharma, P.R. Vaidyanathan

    The Cayley table representation of a group uses O(n2) words for a group of order n and answers multiplication queries in time O(1). It is interesting to ask if there is a o(n2) space representation of groups that still has O(1) query-time. We show that for any δ, 1/log⁡n≤δ≤1, there is an O(n1+δ/δ) space representation for groups of order n with O(1/δ) query-time. We also show that for Dedekind groups

  • Tight hierarchy of data-independent multi-head automata
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-07-03
    Pavol Ďuriš, Rastislav Královič, Dana Pardubská

    We study the expressive power of 1-way data-independent finite automata with k heads (1DiDFA(k)). The data-independence means that the trajectory of each head during a computation depends only on the length of the input word. It has long been known that “k+1 heads are better than k” for the (data-dependent) 1DFA(k), and (2-way) 2DiDFA(k). However, somewhat surprisingly, no such hierarchy has been known

  • Secure-channel free searchable encryption with multiple keywords: A generic construction, an instantiation, and its implementation
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-06-20
    Keita Emura, Katsuhiko Ito, Toshihiro Ohigashi

    In public key encryption with keyword search (PEKS), a secure channel is required in order to send trapdoors to the server, whereas in secure-channel free PEKS (SCF-PEKS), no such secure channel is required. In this paper, we propose a generic construction of SCF-PEKS with multiple keywords (SCF-MPEKS) from hidden vector encryption, tag-based encryption, and a one-time signature. Our generic construction

  • Counting and enumerating tree-child networks and their subclasses
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-06-09
    Gabriel Cardona, Louxin Zhang

    Galled trees are studied as a recombination model in population genetics. This class of phylogenetic networks is generalized into tree-child and galled network classes by relaxing a structural condition imposed on galled trees. We provide a solution to an open problem that is how to count and enumerate tree-child networks with fixed number of leaves and reticulations. Explicit counting formulas are

  • Universal stability in multi-hop radio networks
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-06-04
    Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski

    We study stability of routing in multi-hop wireless networks in the framework of adversarial queueing. A routing algorithm consists of three components: a transmission policy to decide on immediate transmissions, a scheduling policy to select a packet to transmit, and a hearing control to coordinate transmissions with scheduling. We consider two kinds of hearing control: proactive and reactive. We

  • Unique end of potential line
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-06-01
    John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani

    The complexity class CLS was proposed by Daskalakis and Papadimitriou in 2011 to understand the complexity of important NP search problems that admit both path following and potential optimizing algorithms. Here we identify a subclass of CLS – called UniqueEOPL – that applies a more specific combinatorial principle that guarantees unique solutions. We show that UniqueEOPL contains several important

  • How fast can we reach a target vertex in stochastic temporal graphs?
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-28
    Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis, Viktor Zamaraev

    Temporal graphs abstractly model real-life inherently dynamic networks. Given a graph G, a temporal graph with G as the underlying graph is a sequence of subgraphs (snapshots) Gt of G, where t≥1. In this paper we study stochastic temporal graphs, i.e. stochastic processes G whose random variables are the snapshots of a temporal graph on G. A natural feature observed in various real-life scenarios is

  • Subexponential algorithm for d-cluster edge deletion: Exception or rule?
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-27
    Neeldhara Misra, Fahad Panolan, Saket Saurabh

    We study the question of finding a set of at most k edges, whose removal makes the input n-vertex graph a disjoint union of s-clubs (graphs of diameter s). Komusiewicz and Uhlmann [DAM 2012] showed that Cluster Edge Deletion (i.e., for the case of 1-clubs (cliques)), cannot be solved in time 2o(k)nO(1) unless the Exponential Time Hypothesis (ETH) fails. But, Fomin et al. [JCSS 2014] showed that if

  • An improved algorithm for the minmax regret path center problem on trees
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-27
    Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li

    This paper studies the problem of finding a path center on a tree in which vertex weights are uncertain and the uncertainty is described by given intervals. It is required to find a minmax regret solution, which minimizes the worst-case loss in the objective function. An O(n log n)-time algorithm is presented, improving the previous upper bound of O(n2).

  • Finding connected secluded subgraphs
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-23
    Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre

    Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. However, for many applications, it is desirable that the found subgraph has as few connections to the rest of the graph as possible, which gives rise to the Secluded Π-Subgraph problem. Here, input k is the size of the desired subgraph, and input t is a limit on the

  • Multi-round cooperative search games with multiple players
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-22
    Amos Korman, Yoav Rodeh

    A treasure is placed in one of M boxes according to a known distribution and k searchers are searching for it in parallel during T rounds. How can one incentivize selfish players so that the probability that at least one player finds the treasure is maximized? We focus on congestion policies C(ℓ) specifying the reward a player receives being one of the ℓ players that (simultaneously) find the treasure

  • A 1.375-approximation algorithm for unsigned translocation sorting
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-22
    Lianrong Pu, Daming Zhu, Haitao Jiang

    Translocation has been long learned as a basic operation to rearrange the structure of a genome. Translocation sorting asks to find a shortest sequence of translocations that transforms one genome into another, which has attracted attention of many scientists in algorithm design. Signed translocation sorting can be solved in polynomial time. Unsigned translocation sorting turns out to be NP-Hard and

  • A counterexample to Thiagarajan's conjecture on regular event structures
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-19
    Jérémie Chalopin, Victor Chepoi

    We provide a counterexample to a conjecture by Thiagarajan (1996, 2002) that regular event structures correspond to event structures obtained as unfoldings of finite 1-safe Petri nets. The same counterexample is used to disprove a closely related conjecture by Badouel, Darondeau, and Raoult (1999). Using that domains of events structures are CAT(0) cube complexes, we construct our counterexample from

  • Disconnected cuts in claw-free graphs
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-11
    Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen

    A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The corresponding decision problem is called Disconnected Cut. This problem is known to be NP-hard on general graphs. We prove that it is polynomial-time solvable on claw-free graphs, answering a question of Ito et al. (TCS 2011). The basis for our result is a decomposition theorem for claw-free

  • Graph reconstruction in the congested clique
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-06
    P. Montealegre, S. Perez-Salazar, I. Rapaport, I. Todinca

    In this paper we study the reconstruction problem in the congested clique model. Given a class of graphs G, the problem is defined as follows: if G∉G, then every node must reject; if G∈G, then every node must end up knowing all the edges of G. The cost of an algorithm is the total number of bits received by any node through one link. It is not difficult to see that the cost of any algorithm that solves

  • Beyond operator-precedence grammars and languages
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-06
    Stefano Crespi Reghizzi, Matteo Pradella

    Operator Precedence Languages (OPL) are deterministic context-free and have desirable properties. OPL are parallely parsable, and, when structurally compatible, are closed under Boolean operations, concatenation and star; they include the Input Driven languages. OPL use three relations between two terminal symbols, to assign syntax structure to words. We extend such relations to k-tuples of consecutive

  • On Weisfeiler-Leman invariance: Subgraph counts and related graph properties
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-05-06
    V. Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky

    The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a fruitful approach to the Graph Isomorphism problem. 2-WL corresponds to the original algorithm suggested by Weisfeiler and Leman over 50 years ago. 1-WL is the classical color refinement routine. Indistinguishability by k-WL is an equivalence relation on graphs that is of fundamental importance for isomorphism testing, descriptive complexity

  • Descriptive complexity of #P functions: A new perspective
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-04-30
    Arnaud Durand; Anselm Haak; Juha Kontinen; Heribert Vollmer

    We introduce a new framework for a descriptive complexity approach to arithmetic computations. We define a hierarchy of classes based on the idea of counting assignments to free function variables in first-order formulae. We completely determine the inclusion structure and show that and appear as classes of this hierarchy. In this way, we unconditionally place properly in a strict hierarchy of arithmetic

  • Multilevel length-based classified index table for IP lookups and updates
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-04-10
    Sun-Yuan Hsieh, Sin-Jie Huang, Tai-Hsuan Ho

    To obtain a high-speed IP address lookup algorithm for wire-speed packet forwarding in Internet routers, a new data structure, called multilevel length-based classified index table, is proposed. This data structure can be divided into multilevel structures on the basis of prefix length distribution. Each level has a corresponding data structure and dynamic router-table operations. Experiments were

  • Eccentricity terrain of δ-hyperbolic graphs
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-03-30
    Feodor F. Dragan, Heather M. Guarnera

    A graph G=(V,E) is δ-hyperbolic if for any four vertices u,v,w,x, the two larger of the three distance sums d(u,v)+d(w,x), d(u,w)+d(v,x), d(u,x)+d(v,w) differ by at most 2δ≥0. This paper describes the eccentricity terrain of a δ-hyperbolic graph. The eccentricity function eG(v)=max⁡{d(v,u):u∈V} partitions vertices of G into eccentricity layers Ck(G)={v∈V:eG(v)=rad(G)+k}, k∈N, where rad(G)=min⁡{eG(v):v∈V}

  • Distributed reconfiguration of maximal independent sets
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-03-30
    Keren Censor-Hillel, Mikaël Rabie

    We investigate a distributed maximal independent set reconfiguration problem, in which there are two MIS for which every node is given its membership status, and the nodes need to communicate with their neighbors to find a reconfiguration schedule from the first MIS to the second. We forbid two neighbors to change their membership status at the same step. We provide efficient solutions when the intermediate

  • Online bin packing with cardinality constraints resolved
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-03-23
    János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

    Bin packing with cardinality constraints is a basic bin packing problem. In the online version with the parameter k≥2, items having sizes in (0,1] associated with them are presented one by one to be packed into unit capacity bins, such that the capacities of bins are not exceeded, and no bin receives more than k items. We resolve the online problem and prove a lower bound of 2 on the overall asymptotic

  • Deciding probabilistic bisimilarity distance one for probabilistic automata
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-03-16
    Qiyi Tang, Franck van Breugel

    Probabilistic bisimilarity, due to Segala and Lynch, is an equivalence relation that captures which states of a probabilistic automaton behave exactly the same. Deng et al. proposed a robust quantitative generalization of probabilistic bisimilarity. Their probabilistic bisimilarity distances of states of a probabilistic automaton capture the similarity of their behaviour. The smaller the distance,

  • Graphs are not universal for online computability
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-03-13
    Rodney Downey, Matthew Harrison-Trainor, Iskander Kalimullin, Alexander Melnikov, Daniel Turetsky

    We show that structures with only one binary function symbol are universal for “online” (punctual) computable structures. In contrast, we give a description of punctually categorical graphs which implies that graphs are not universal for online computability.

  • Complexity of control in judgment aggregation for uniform premise-based quota rules
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-03-09
    Dorothea Baumeister, Gábor Erdélyi, Olivia J. Erdélyi, Jörg Rothe, Ann-Kathrin Selker

    The task of aggregating individual judgments over logically interconnected propositions is called judgment aggregation. Manipulation of judgment aggregation procedures has first been studied by List [45] and Dietrich and List [27], and Endriss et al. [30] were the first to study it from a computational perspective. Baumeister et al. [7] extended their results on manipulation and introduced the concept

  • Subquadratic non-adaptive threshold group testing
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-02-19
    Gianluca De Marco, Tomasz Jurdziński, Dariusz R. Kowalski, Michał Różański, Grzegorz Stachowiak

    We consider threshold group testing – a generalization of group testing, which asks to identify a set of positive individuals in a population, by performing tests on pools of elements. Each test is represented by a subset Q of individuals and its output is yes if Q contains at least one positive element and no otherwise. Threshold group testing is the natural generalization, introduced by P. Damaschke

  • The computational power of parsing expression grammars
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-02-13
    Bruno Loff, Nelma Moreira, Rogério Reis

    We study the computational power of parsing expression grammars (PEGs). We begin by constructing PEGs with unexpected behaviour, and surprising new examples of languages with PEGs, including the language of palindromes whose length is a power of two, and a binary-counting language. We then propose a new computational model, the scaffolding automaton, and prove that it exactly characterises the computational

  • When are epsilon-nets small?
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-02-10
    Andrey Kupavskii, Nikita Zhivotovskiy

    Given a range space (X,R), where X is a set equipped with probability measure P, R⊂2X is a family of measurable subsets, and ϵ>0, an ϵ-net is a subset of X in the support of P, which intersects each R∈R with P(R)≥ϵ. In many situations the size of ϵ-nets depends on ϵ and on natural complexity measures. The aim of this paper is to give a systematic treatment of such complexity measures arising in Computational

  • A multivariate analysis of the strict terminal connection problem
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-02-10
    Alexsander A. Melo, Celina M.H. Figueiredo, Uéverton S. Souza

    A strict connection tree of a graph G for a set W is a tree subgraph of G whose leaf set equals W. The Strict terminal connection problem (S-TCP) is a network design problem whose goal is to decide whether G admits a strict connection tree T for W with at most ℓ vertices of degree 2 and r vertices of degree at least 3. We establish a Poly vs. NP-c dichotomy for S-TCP with respect to ℓ and Δ(G). We

  • The complexity of synthesizing elementary net systems relative to natural parameters
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-01-14
    Christian Rosenke, Ronny Tredup

    Elementary net systems (ENS) are the most fundamental class of Petri nets. Given a labeled transition system (TS) A, feasibility is the NP-complete decision problem whether A can be synthesized into an ENS. We analyze the impact of state degree, the number of allowed successors and predecessors of states in A, and event manifoldness, the amount of occurrences that an event can have in A, on the computational

  • Using decomposition-parameters for QBF: Mind the prefix!
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2020-01-08
    Eduard Eiben, Robert Ganian, Sebastian Ordyniak

    Similar to the satisfiability (SAT) problem, which can be seen to be the archetypical problem for NP, the quantified Boolean formula problem (QBF) is the archetypical problem for PSPACE. Recently, Atserias and Oliva (2014) showed that, unlike for SAT, many of the well-known decompositional parameters (such as treewidth and pathwidth) do not allow efficient algorithms for QBF. The main reason for this

  • Learning the truth vector in high dimensions
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2019-12-30
    Hu Ding, Jinhui Xu

    Truth Discovery is an important learning problem arising in data analytics related fields. It concerns about finding the most trustworthy information from a dataset acquired from a number of unreliable sources. The problem has been extensively studied and a number of techniques have already been proposed. However, all of them are of heuristic nature and do not have any quality guarantee. In this paper

  • Subexponential algorithms for variants of the homomorphism problem in string graphs
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2019-12-30
    Karolina Okrasa, Paweł Rzążewski

    We consider subexponential algorithms finding weighted homomorphisms from intersection graphs of curves (string graphs) with n vertices to a fixed graph H. We provide a complete dichotomy: if H has no two vertices sharing two common neighbors, then the problem can be solved in time 2O(n2/3log⁡n), otherwise there is no subexponential algorithm, assuming the ETH. Then we consider locally constrained

  • Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2019-12-27
    Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Živný

    We analyse the complexity of approximate counting constraint satisfactions problems #CSP(F), where F is a set of nonnegative rational-valued functions of Boolean variables. A complete classification is known if F contains arbitrary unary functions. We strengthen this result by fixing any permissive strictly increasing unary function and any permissive strictly decreasing unary function, and requiring

  • Hitting minors on bounded treewidth graphs. III. Lower bounds
    J. Comput. Syst. Sci. (IF 1.494) Pub Date : 2019-12-12
    Julien Baste, Ignasi Sau, Dimitrios M. Thilikos

    For a finite fixed collection of graphs F, the F-M-Deletion problem consists in, given a graph G and an integer k, decide whether there exists S⊆V(G) with |S|≤k such that G∖S does not contain any of the graphs in F as a minor. We provide lower bounds under the ETH on the smallest function fF such that F-M-Deletion can be solved in time fF(tw)⋅nO(1) on n-vertex graphs, where tw denotes the treewidth

Contents have been reproduced by permission of the publishers.
Springer 纳米技术权威期刊征稿
ACS ES&T Engineering
ACS ES&T Water
ACS Publications填问卷