Showing papers in "Journal of Computer and System Sciences in 2018"

TL;DR: It is shown that a large class of reconfiguration problems becomes tractable on graphs of bounded treedepth, and that this result is in some sense tight.

TL;DR: This research presents an evolutionary game theoretic framework to investigate the economic benefits of cybersecurity information sharing and analyze the impacts and consequences of not participating in the game.

TL;DR: A new parameterized approximation paradigm which studies the interaction between approximation ratio and running time for any parametrization of a given optimization problem and introduces the concept of an α-shrinking transformation, for α ≥ 1.

TL;DR: This paper presents an optimal partitioning strategy based on the distribution of non-zero elements in a sparse matrix to improve the performance of SpMV, and uses a hybrid format, which mixes CSR and ELL formats, to store the blocks partitioned from the sparse matrix.

TL;DR: This work studies reconfiguration variants of two classical vertex-subset problems, namely Independent Set and Dominating Set, and shows that is fixed-parameter tractable parameterized by k when the input graph is of bounded degeneracy or nowhere dense.

TL;DR: In this paper, the authors introduce a syntactic class of problems that contains known complexity subclasses of TFNP problems, and define the search for an error in a concisely-represented formal proof.

TL;DR: It is shown that the uniform asymmetric rules exhibit cycles of super-polynomial length, whereas symmetric ones are known to have bounded cycle length, and that no symmetric rule can be intrinsically universal.

TL;DR: An algorithm to find a maximum dimensional noiseless subsystem of a quantum communicating system is given using decomposition techniques of quantum Markov chains, and a limit theorem is established for them.

TL;DR: The main contributions include the first index of sub-quadratic size to achieve a sub-linear query time in any dimension and a conditional lower bound for most-likely range-max queries, based on the conjectured hardness of the set-intersection problem.

TL;DR: In this article, an exact quantum algorithm for solving Simon's problem with O( n ) queries was proposed, which is simple, concrete and does not rely on special query oracles.

TL;DR: The non-emptiness problem for the picture-processing automaton model turns out to be NP-complete, and several combinatorial, algebraic and decidability results for the corresponding class of picture languages are derived.

TL;DR: A numerical example is presented that validates the proposed RL approach measuring the benefits for security resource allocation, and considers that defenders and attackers conforms coalitions in the Stackelberg security game, these are reached by computing the Strong Lp-Stackelburg/Nash equilibrium.

TL;DR: A hierarchy of uniform continuity properties for process algebra operators are considered and, for each of these properties, a Structural Operational Semantics specification format is proposed ensuring that the property is satisfied by construction by all operators captured by the format.

TL;DR: A superlinear lower bound for circuits of arbitrary constant depth is proved, and an Ω ˜ ( n 2 ) lower bound is proved for the special case of depth-4 AC 0 ∘ MOD 2 of depth four or greater.

TL;DR: This work presents the first practically-self-stabilizing virtual synchrony algorithm that uses a new counter algorithm that establishes an efficient practically unbounded counter, which in turn can be directly used for emulating a self-st stabilizing Multiple-Writer Multiple-Reader (MWMR).

TL;DR: A set of techniques for analyzing games where the players' strategies come from a fixed, discrete set, and where players may have different preferences among the possible strategies are developed.

TL;DR: Light is shed on the kernelization complexity of DFVS, a well-known open problem in Parameterized Complexity, and it is proved that the former kernel size is tight under certain complexity theoretic assumptions.

TL;DR: In this article, a parameterized algorithm with running time O(2.42 k m 3 n 4 ) for the maximum agreement forest problem on multiple rooted multifurcating phylogenetic trees is presented.

TL;DR: A subclass of metric graphs is identified that Δ β -S p HCP is polynomial-time solvable and some r ( β ) -approximation algorithms given in this paper meet approximation lower bounds.

TL;DR: This work provides strong lower bounds on the running times of exact and approximation schemes for the classical scheduling problem based on Exponential Time Hypothesis, showing that the best known approximation and exact algorithms are almost the best possible in terms of the running time.

TL;DR: This work presents the first single-exponential fixed-parameter tractable algorithm for vertex deletion to distance-hereditary graphs, a well-studied graph class which is particularly important in the context of vertex deletion due to its connection to the graph parameter rank-width.

TL;DR: The algebraic approach to the CSP is used to give new natural algebraic conditions for the finiteness of the integrality gap for the basic LP relaxation of VCSP, and it is shown that the absence of another algebraic condition leads to NP-hardness of constant-factor approximation.

TL;DR: This paper proves that the so-called gate elimination technique cannot achieve linear bounds of cn beyond a certain constant c, where c depends only on the number of substitutions made at a single step of the induction.

TL;DR: It is shown that every Turing-decidable predicate on labeled networks can be decided locally if nodes are running alternating Turing machines (ATM), and that, for every such predicate, there is a local algorithm for ATMs that decides whether the actual labeled network satisfies that predicate.

TL;DR: This work provides strong upper bounds and almost tight lower bounds (by proving the “Thermal Theorem”) for the traditional notion of fixation probability of Lieberman et al., i.e. assuming a random initial placement of the mutant.

TL;DR: By allowing only positive data comparisons the authors find natural fragments with better static analysis properties, and the containment problem is PSpace -complete in the case of regular queries with data tests and ExpSpace - complete in the cases ofregular queries with memory.

TL;DR: This paper designs algorithms which solve the Undirected Eulerian Edge Deletion problem and the corresponding problem in digraphs in time 2 O ( k ) n O ( 1 ) , improving the algorithms by Cygan et al. and affirmatively answer the open problem posed by them.

TL;DR: A 2D Dependency Pair Framework is introduced for automatically proving and disproving all the termination properties of conditional term rewriting systems and is suggested to be the most powerful technique for proving operational termination of conditionalterm rewriting systems.

TL;DR: The algorithmic, closure and expressiveness properties of VPT are studied to define transformations from nested words to words and can be seen as a subclass of pushdown transducers.

TL;DR: An enhancement of color coding is introduced to design deterministic polynomial-space parameterized algorithms for k -Colorful Out-Branching on arc-colored digraphs and k - colorful Perfect Matching on planar edge-colored graphs.