Showing papers in "Theoretical Computer Science in 2016"

TL;DR: It is proved that, for luminous robots, to have O ( 1 ) colors and a single snapshot renders them more powerful than to have an unlimited amount of persistent memory (including snapshots) but no lights, and it is still open whether or not asynchronous luminous Robots with O (1 ) colors are morepowerful than fully-synchronous robots without lights.

TL;DR: In this paper, the authors introduce delta-cliques, which generalize graph cliques to link streams/time-varying graphs, and provide a greedy algorithm to compute all delta cliques of a link stream.

TL;DR: The theory offers novel unsupervised learning algorithms for "deep" architectures for image and speech recognition, and conjecture that the main computational goal of the ventral stream of visual cortex is to provide a hierarchical representation of new objects/images which is invariant to transformations, stable, and selective for recognition.

TL;DR: The results indicate that branch-and-reduce algorithms are actually quite practical and competitive with other state-of-the-art approaches for several kinds of instances, thus showing the practical impact of theoretical research on branching algorithms.

TL;DR: It is proved that, it cannot be approximated within cn, for some constant c > 0 , in a special case of temporal graphs and within ( 2 − e ) , for every constant e > 0, in another special case in which D ( t ) is strongly connected for all 1 ≤ t ≤ l , both unless P = NP .

TL;DR: The notion of connectivity is extended by introducing two new kinds of connectivity, called structure connectivity and substructure connectivity, respectively, which are related to its reliability and fault tolerability and to the network's robustness.

TL;DR: The universality of these systems as number generating devices is proved for the two usual ways to define the output and for various restrictions on the spiking rules.

TL;DR: A solution to the M-M assignment problem by improving the K-M algorithm with backtracking (KMB) is proposed and the proposed KMB algorithm is valid and the worst time complexity is O ( ( ? L a i ) 3 ) .

TL;DR: In this paper, a simple linear-time algorithm is presented for constructing a context-free grammar of size 4 g log 3 / 2? ( N / g ) for the input string, where N is the size of the input text and g is the length of the optimal grammar generating this text.

TL;DR: Simulative results substantiate the effectiveness and superiorness of the proposed FTZNN model for online time-varying matrix inversion, as compared with the GNN model and the original ZNN model.

TL;DR: It is proved that every IC-planar graph admits a straight-line RAC drawing, which may require however exponential area, and a polynomial-time algorithm is described that tests whether a triangulated plane graph augmented with a given set of edges that form a matching is IC- Planar.

TL;DR: The component connectivity of the hypercube c ź r + 1 ( Q n ) = - r 2 2 + ( 2 n - 5 2 ) r - n 2 + 2 n + 1 for n +1 Ż r ź 2 n- 5, n ź 6 .

TL;DR: The results show that the g-good-neighbor conditional diagnosability of 3-ary n-cube is g 2 ( 2 n - g + 1 ) - 1 and g - 1 2 ( 4 n - 2 g +1) - 1 when the g value is even and odd, respectively.

TL;DR: This paper gives that the 2-good-neighbor diagnosability of C ?

TL;DR: It is proved that reversibility in the authors' calculus is causally consistent and that the causal information used to support reversibilityIn rho π is consistent with the one used in the causal semantics of the π-calculus developed by Boreale and Sangiorgi.

TL;DR: The results reveal the importance of structures like grids and trees that allow to overcome the multiplicity detection with respect to the ring case and show that on these topologies, the multiplier detection is not required.

TL;DR: This paper proposes the first lattice-based linearly homomorphic signature in the standard model, which settle this open problem and is proposed as a open problem by Freeman 12.

TL;DR: Four fundamental principles that characterize the common features of all models of computation and interaction are proposed that suffice to support a model independent treatment of the two most important relationships in computer science, the equality between processes and the relative expressiveness between models.

TL;DR: It is proved that, with rigid movements, finite-state robots can rendezvous in SSynch, and that finite-communication robots are able to rendezvous even in ASynch.

TL;DR: It is proved that non-cooperating P systems with at most one promoter associated with any rule, working in the flat maximally parallel way, are Turing universal (the Turing universality of such P systems is open if they work in the maximally Parallel way).

TL;DR: The article first provides the necessary evidence that the axiomatization presented in this article characterizes indeed the whole class of (synchronous) parallel algorithms, then formally proves that parallel algorithms are captured by Abstract State Machines (ASMs).

TL;DR: An algorithm for learning an unknown regular set of infinite words, using membership and equivalence queries, and it is shown that the second can be exponentially smaller than the first, and the third is at most as large as the first two.

TL;DR: In this article, the relationship between conditional diagnosability and 2-extra connectivity of a regular graph G with some acceptable conditions has been shown for some well-known classes of vertex-transitive graphs, including, star graphs, alternating group networks, ( n, k ) -arrangement graphs, Cayley graphs obtained from transposition generating trees, bubble-sort graphs, dual-cubes, pancake graphs and hierarchical hypercubes as well.

TL;DR: The concept of MultiAspect Graph is introduced as a graph generalization that is proves to be isomorphic to a directed graph, and also capable of representing all previous generalizations.

TL;DR: This paper proves the first bounds on the size of search spaces that depend solely on structural parameters of the input graph, that is, they are independent of the edge lengths, and establishes a connection with the well-studied elimination game.

TL;DR: It is proved that the problem remains PSPACE-complete even for planar graphs, bounded bandwidth graphs, split graphs, and bipartite graphs and the problem can be solved in linear time for cographs, forests, and interval graphs.

TL;DR: This work proposes and analyzes heterogeneous facility location without money, a novel model wherein agents' locations are disclosed to the mechanism and agents bid for the set of facilities they are interested in (as opposed to bidding for their position on the network).

TL;DR: This paper constructs practical fully distributed (the private key is born distributed), non-interactive schemes—where the servers can compute their partial signatures without communication with other servers—with adaptive security (i.e., the adversary corrupts servers dynamically based on its full view of the history of the system).

TL;DR: A survey of lattice theory, from the algebraic definition of a lattice to that of a concept lattice, through closure systems and implicational rules; including the exploration of fundamental bijective links between lattices, reduced contexts and bases of implicatory rules; and concluding with the presentation of the main generation algorithms of these objects.

TL;DR: This work transforms a -approximation algorithm for TSP into approximation algorithms for MMCCP, RMMCCP and MCCP with ratios 4, 4+1 and 4, respectively, which improve the previous algorithms in term of both approximation ratios and running times.