Showing papers in "Theoretical Computer Science in 2014"

TL;DR: A protocol for coin-tossing by exchange of quantum messages is presented, which is secure against traditional kinds of cheating, even by an opponent with unlimited computing power, but ironically can be subverted by use of a still subtler quantum phenomenon, the Einstein-Podolsky-Rosen paradox.

TL;DR: The discrepancy minimization adaptation algorithm is extended to the more significant case where kernels are used and it is shown that the problem can be cast as an SDP similar to the one in the feature space and techniques from smooth optimization can be used to derive an efficient algorithm for solving such SDPs.

TL;DR: This survey article reviews and compares the properties of the existing key establishment techniques, QKD being one of them, and studies two generic scenarios related to the practical use of QKKD in cryptographic infrastructures: 1) usingQKD as a key renewal technique for a symmetric cipher over a point-to-point link; 2) using QD in a network containing many users with the objective of offering any- to-any key establishment service.

TL;DR: The theory of non-elitist evolutionary algorithms (EAs) is extended by considering the offspring population size in the (1,@l) EA and a sharp threshold is established at @l=log" e"e"-"1n~5log"1"0n between exponential and polynomial running times on OneMax.

TL;DR: It is proved that i) if no limit is imposed on the number of spikes in any neuron during any computation, such systems can generate the sets of Turing computable natural numbers and thesets of vectors of positive integers computed by k-output register machine, which gives a positive answer to the problem formulated in Song et al. 2014.

TL;DR: In this article, the authors review the progress in practical quantum key distribution focusing on the elements of trust that are common to classical and quantum implementations of key distribution, and some threats to security that have been highlighted recently.

TL;DR: It is shown that, compared to the classical correspondents, a significant speedup can be achieved by expressing parts of the computational process in terms of problems that can be solved using these quantum techniques.

TL;DR: Two simple randomised search heuristics, random local search and the (1+1) evolutionary algorithm, are analysed on some well-known example problems and upper and lower bounds on the expected quality of a solution for a fixed budget of function evaluations are proven.

TL;DR: In this paper, the problem of finding a minimum cardinality target set that eventually activates the whole graph G is hard to approximate to a factor better than O(2^{log √ log √ 1- √ √ ϵ + ϵ − 1 − 1}.

TL;DR: This work introduces a new string matching problem called order-preserving matching on numeric strings, where a pattern matches a text if the text contains a substring of values whose relative orders coincide with those of the pattern.

TL;DR: It is proved that the SGA has exponential runtime with overwhelming probability for population sizes up to @m=10,000 for OneMax.

TL;DR: Lyndon words are used and the Lyndon structure of runs are introduced as a useful tool when computing powers and in problems related to periods some versions of the Manhattan skyline problem are used.

TL;DR: This paper considers the string guessing problem as a generic online problem and shows a lower bound on the number of advice bits needed to obtain a good solution, and uses special reductions from string guessing to improve the best known lower bound for the online set cover problem and to give a lower Bound on the advice complexity of the online maximum clique problem.

TL;DR: The classic linear-time–branching-time spectrum is extended to a quantitative setting, parametrized by trace distance, and a general transfer principle is proved, showing that all system distances are mutually topologically inequivalent.

TL;DR: This work describes a new data structure based on relative Lempel–Ziv compression that is space-efficient and also supports fast pattern searching.

TL;DR: It is proved that, in a resource augmentation model, a constant number of advice bits suffices to achieve a near-optimal competitive ratio when allowing the online algorithm to overpack the knapsack by some small amount, and that an arbitrary number of random bits does not permit a constant competitive ratio.

TL;DR: A new bound is proved for a modified version of Upper Confidence Reinforcement Learning with only cubic dependence on the horizon, which is unimprovable in all parameters except the size of the state/action space, where it depends linearly on the number of non-zero transition probabilities.

TL;DR: This work surveys probabilistic cellular automata with approaches coming from combinatorics, statistical physics, and theoretical computer science, each bringing a different viewpoint.

TL;DR: This work gives a time-free solution to SAT problem using P systems with active membranes in the sense that the correctness of the solution does not depend on the precise timing of the involved rules.

TL;DR: The proposed DQBF formulation is established from a synthesis perspective concerned with Skolem-function models and Herbrand-function countermodels, and a generalized resolution rule is shown to be sound, but incomplete, for DQ BF evaluation.

TL;DR: It is proved that for quasi-expansive D-dimensional CA the topological entropy (which is an uncomputable property for general CA) has infinite value and the notions of quasi-sensitivity and quasi-almost equicontinuity are introduced and studied.

TL;DR: An MH-IBPRE is proposed that maintains the (constant) ciphertext size and computational complexity regardless of the number of re-encryption hops and is proven secure against selective identity and chosen-ciphertext attacks and collusion resistant in the standard model.

TL;DR: It is proved that the variant of the first problem, in which the number of blocking pairs must be minimized with respect to some fixed matching, is NP-hard, whereas this variant ofThe second problem is polynomial-time solvable.

TL;DR: A practical decision procedure for Propositional Projection Temporal Logic with infinite models using the generalized Buchi accepting condition for automata to identify a path in an LNFG as a model of the formula.

TL;DR: The results not only characterize the period distribution of the cat map, which gives insights to various applications, but also demonstrate some approaches to deal with the period of a polynomial in the Galois ring.

TL;DR: This paper identifies all fragments of Halpern and Shoham's interval temporal logic HS with a decidable satisfiability problem over the class of strongly discrete linear orders as well as over its relevant subclasses (the class of finite linear orders, Z, N, and Z - ).

TL;DR: The well-known parsing algorithm for context-free grammars due to Valiant (1975) is analyzed and extended to handle the more general Boolean Grammars, which are context- free grammar augmented with conjunction and negation operators in the rules.

TL;DR: The discounted utility model of Samuelson is generalised to allow age-dependent discount functions, including a complete characterisation of time-(in)consistent discounts, the existence of sub-game perfect equilibrium policies where the discount function is time-inconsistent and a continuity result showing that ''nearly'' time-consistent discount rates lead to 'nearly' time- Consistent behaviour.

TL;DR: A colouring of a graph G=(V

TL;DR: This paper proposes two self-stabilizing counting protocols for a passively-mobile sensor network with a base station and reduces the gap of the feasibility between P and 4 P, the maximum number of sensors.