Showing papers in "Theoretical Computer Science in 2017"

TL;DR: This paper proposes a framework that includes many of these variations of the BWT by designing straightforward finite-state automata for the relevant problems and showing that their state diagrams are Wheeler graphs.

TL;DR: This work introduces an interval iteration algorithm, for which the stopping criterion is straightforward, and exhibits its convergence rate, and significantly improves the upper bound on the number of iterations required to get the exact values.

TL;DR: The FRQA representation is a normalized state that facilitates basic audio signal operations targeting the amplitude and time parameters and can be employed as the major components to build advanced operations for specific applications as well as facilitate secure transmission of audio content in the quantum computing domain.

TL;DR: This paper generalizes the results of [12] by determining κ ( Q n and F Q n ) and κ s (Q n ; T ) for T ∈ { P k, C 2 k, K 1, 4 } where 3 ≤ k ≤ n .

TL;DR: This work presents a worst-case work-optimal universal coating algorithm that uniformly coats any object of arbitrary shape and size that allows a uniform coating.

TL;DR: For these classes of graphs, the results for cographs lead to linear-time algorithms to solve the considered problems on inputs that are cographs and tight lower bounds for the size of such solution sets depending on the order of the input graph are given.

TL;DR: Experimental results on two QUBO formulations of the Graph Isomorphism Problem suggest that the direct formulation is more practical than the others with respect to running on the D-Wave architecture.

TL;DR: A generalized neighborhood for d-dimensional cellular automata is introduced; it spans the range from von Neumann's to Moore's neighborhood using a parameter which represents the dimension of hypercubes connecting neighboring cells.

TL;DR: In the paper, the complexity of the reachability problem, the computation of transitive closure and transitive reduction of directed hypergraphs and the computations of minimum coverings for a set of functional dependencies are considered.

TL;DR: This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.

TL;DR: This work studies the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time, and shows how to solve Longest Path on Interval Graphs, parameterized by vertex deletion number k to proper interval graphs, in O(k9n) time.

TL;DR: It is proved that the switch chain for undirected graphs is rapidly mixing for any degree sequence with minimum degree at least 1 and with maximum degree $d_{\max}$ which satisfies $3\leq d_{\ max}\leq \frac{1}{3}\, \sqrt{M}$, where $M$ is the sum of the degrees.

TL;DR: In this paper, the authors introduce Time Window Temporal Logic (TWTL), a rich expressive language for describing various time bounded specifications, which enable the compact representation of serial tasks, which are prevalent in various applications including robotics, sensor systems and manufacturing systems.

TL;DR: It is shown that the g-good-neighbor diagnosability of the ( n , k ) -star graph S n, k under the PMC model and the comparison model is n + g ( k - 1 ) - 1 , respectively.

TL;DR: The main purpose of this work is to generalize the foundations of rewriting modulo axioms to the conditional order-sorted case, and to propose the notion of strict coherence, which makes rewritingModuloAxioms simpler and easier to understand.

TL;DR: Some interesting structural properties of the dissociation sets and 3-path vertex covers of maximum size and minimum size in graphs are revealed, which allow them to be solved in O * ( 1.4656 n ) time and polynomial space or O *( 1.3659 n) time and exponential space.

TL;DR: A survey of mathematical theory of implications with an emphasis on the progress made in the last 30 years can be found in this paper, where the authors discuss functional dependencies, strong association rules, and implications.

TL;DR: In this paper, Nong et al. presented algorithms g SAIS and g SACA-K to construct the suffix array for a string collection maintaining their theoretical bounds, respecting the order among all suffixes, and improving their practical performance.

TL;DR: In this paper, a compressed index based on the Lempel-Ziv 1977 compression scheme is presented, which uses O(m + occ lg lg ⁡ lg n + lg ϵ ϵ n + o(m lg ε n ) time for constant-sized alphabets, where n and m are the length of the input string and query string respectively.

TL;DR: It is shown that it is NP-hard to compute -concave hull on a set of points for any 0<<, which leads to a generalization of Fekete work (when =) and MACP is introduced as an NP- hard problem similar to the problem of computing -conCave hull and an approximation algorithm is presented.

TL;DR: This paper proposes a new theory of monitored π-calculus with dynamic usage of multiparty session types (MPST), offering a rigorous foundation for safety assurance of distributed components which asynchronously communicate through multiparty sessions.

TL;DR: A new systematic approach to studying algorithms on algebraic structures via primitive recursion is suggested to fill the gap between abstract computable structure theory and feasible algebra.

TL;DR: An NP-hardness result is proved for the first question and the second question is positively answered by describing a drawing algorithm for 1-planar graphs by solving the relationship between 1- Planar and k-bend RAC graphs.

TL;DR: This work designs and analyzes algorithms for online linear optimization that have optimal regret and at the same time do not need to know any upper or lower bounds on the norm of the loss vectors, and shows higher bounds on scale-free algorithms based on Mirror Descent on unbounded domains.

TL;DR: Newton's method is used to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and it is shown that the method can be turned into an algorithm that can be applied routinely to finding all roots without deflation and with the inherent numerical stability of Newton's method.

TL;DR: This paper shows that the g-good-neighbor conditional diagnosabilities of star graph Sn under the PMC and MM* model are (ng)(g+1)!1 for n4 and 0gn2.

TL;DR: An efficient quantum algorithm is introduced to approximate s i in time O ( log ź n ) when A is sparse and the ratio between A's largest singular value and smallest non-zero singular value is constant, which gives an exponential speedup over the best known classical algorithms.

TL;DR: The g-extra conditional diagnosability of Q n is found to be ( g + 1 ) n − g − C g 2 for n ≥ 5 and 1 ≤ g ≤ n − 1 4 under the MM* model, which can measure the reliability of interconnection networks in heterogeneous environments more accurately than traditionaldiagnosability.

TL;DR: WithinStrip Discrete Unit Disk Cover (WSDUDC) as discussed by the authors is a restricted version of the DUDC problem, where the points and disk centres are conned to a strip of xed height.

TL;DR: The state of the art in the area of conditional diagnosability of multiprocessor systems is extended by determining a larger class of networks that are conditionally ( 3 n − 3 − C ( G ) ) -diagnosable.