Showing papers in "Theoretical Computer Science in 2018"

TL;DR: A Quantum-inspired Multimodal Sentiment Analysis (QMSA) framework that aims to fill the “semantic gap” and model the correlations between different modalities via density matrix and significantly outperforms a wide range of baselines and state-of-the-art methods.

TL;DR: The r -component (edge) connectivity of twisted cubes TN n T N n for small r is determined and other properties of TN nT N n are proved.

TL;DR: This paper shows that the n-dimensional balanced hypercube B H n, which is a variant of hypercube Q n, is still strongly Menger (edge) connected even when there are ( 2 n − 4 ) faulty vertices for n ≥ 2, and it is shown that the 3-extra edge-connectivity of B Hn is 8 n − 8 for n ≤ 2.

TL;DR: A quantum model for the meaning associated with corpora of written documents, like the pages forming the World Wide Web is elaborate, drawing its inspiration from previous studies on operational-realistic approaches to quantum physics and quantum modeling of human cognition and decision-making.

TL;DR: In this article, it is shown that consensus is impossible under a message adversary that guarantees weak connectivity only, and introduce eventually vertex-stable source components (VSSCs) as a means for circumventing this impossibility.

TL;DR: The k-gap-planar graph family as discussed by the authors is a family of graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most k of its crossings.

TL;DR: Li et al. as discussed by the authors introduced the first lattice-based VLR group signature, and thus, the first such scheme that is believed to be quantum-resistant, which has several noticeable advantages: support of membership revocation, logarithmic-size signatures, and milder hardness assumptions.

TL;DR: This work studies local checkability of network properties like s – t reachability, or whether the network is acyclic or contains a cycle, by exploring the similarities between prover-and-verifier pairs and Software Defined Networks (SDNs).

TL;DR: In this paper, the boundary between decidability and undecidability of session subtyping relations has been examined in the context of session types and session types are behavioural types for guaranteeing that concurrent programs are free from basic communication errors.

TL;DR: The asymptotic value of the burning number of the hypercube graphs is determined and a conjecture for its exact value is presented and a lower bound on the burningNumber of the strong product of graphs is obtained in terms of their diameters.

TL;DR: In this paper, it was shown that the complexity of vertex cover, feedback vertex set and odd cycle transversal is polynomial-time solvable for s P 2 -free graphs for every constant s ≥ 1.

TL;DR: In this paper, the authors considered scheduling parallelizable jobs in the non-clairvoyant speed scaling setting to minimize the objective of weighted flow time plus energy, and gave a scalable algorithm under the natural assumption that the algorithm can know the current parallelizability of a job.

TL;DR: In this article, the authors studied the complexity of the problem of reducing a fixed graph parameter π of G by at least d via k graph operations from some fixed set S, where S = { ec, vd } and π ∈ { χ, ω, α } restricted to H-free graphs.

TL;DR: This paper first studies the SMP number of some special graph classes, and gives some sharp upper and lower bounds of S MP number, and investigates the Nordhaus–Gaddum-type relations on SMPNumber.

TL;DR: The result of Qiao and Yang is improved by showing that all n-dimensional folded hypercubes are ( 3 n − 5 ) -conditional edge-fault-tolerant strongly Menger edge connected for n ≥ 5 and an example is presented to show that the result is optimal with respect to the maximum tolerated edge faults.

TL;DR: A unified approach is developed by considering various sufficient conditions of a regular graph to be F -strongly Menger-edge-connected of order r and the corresponding vertex version and several results on fundamental classes of interconnection networks are presented.

TL;DR: It is shown that G C D ( a 1, a 2, … , a k ) = 1 is a necessary and sufficient condition for the robots to have an algorithm to solve the team assembling problem in a self-stabilizing manner, i.e., starting from any arbitrary initial configuration, the robots form teams according to the specification.

TL;DR: It is shown that simple algorithms exist which achieve optimal worst case evacuation times for the cases where the robots begin colocated with an arbitrary arrangement of the exits; and when the exits are either colocated or evenly spaced, with arbitrary starting positions of the robots.

TL;DR: This work generalizes the 15 puzzle to an n × n board with n 2 − 1 squares, and considers the problem of determining whether a given end configuration can be reached from a given start configuration via at most a given number of moves.

TL;DR: It is shown that the method described can be designed a program for obtaining easily the exact number of spanning trees of some models, including ladder-graph with zero clustering coefficient, wheel-graph having nonzero clustering coefficients and so on.

TL;DR: It is shown that the limit in the definition exists, and it is proved that it dominates the topological entropy of the associated one-dimensional shift of finite type when the labeling of the tree shares the same restrictions.

TL;DR: The parameterized complexity of NP-hard optimization versions of Stable Matching and Stable Roommates in the presence of ties and incomplete lists is studied to maximize/minimize the size of the stable matching and fixed-parameter tractable versions admit small kernels.

TL;DR: In this paper, the authors present some of the results known from the literature, different techniques used, some new problems, and open problems for the problem of finding a minimum number of queries, optimal time complexity, and optimal resources.

TL;DR: Aategorical compositional models of natural language exploit grammatical structure to calculate the meaning of sentences from the meanings of individual words, and this approach outperforms conventional techniques for some standard NLP tasks.

TL;DR: General procedures for constructing, estimating, and testing Hilbert space multi-dimensional (HSM) models, built from quantum probability theory, are presented and produce parameter estimates that provide a simple and informative interpretation of the complex collection of tables.

TL;DR: A linear time combinatorial method is developed for the problem with edge length augmentation and an algorithm with cubic running time is devised for the reduction case.

TL;DR: It is shown that any unsatisfiable 2CNF formula has a refutation, in which any clause needs to be used at most twice, which is surprising, in light of the fact that there exist polynomial time refutation schemes for 2C NF formulas.

TL;DR: A new data structure is presented here, the subgraph stack, that allows graph algorithms centered around recursive calls on substantially smaller subgraphs to be implemented in a space-efficient manner.

TL;DR: In this article, the authors consider manipulation with incomplete information, where the manipulators do not have accurate knowledge of all the other votes of the non-manipulators, and show that computational hardness is a valid obstruction to manipulation.

TL;DR: In this article, the authors propose safe reachability, which always computes a superset of the set of reachable states from a set of initial states, and show that the best Scott continuous approximation of an analysis A is also its best robust approximation.