Titlebook: Automata, Languages and Programming; 37th International C Samson Abramsky,Cyril Gavoille,Paul G. Spirakis Conference proceedings 2010 Sprin

儲備

Hanne-Margret Birckenbach,Christian Wellmanny be caused by measurements errors, or natural features of the phenomenon. This paper studies the problem of recovering the correct cycle from data corrupted by various error models, formally defined as the .. Specifically, we define a metric property which we call . and study the period recovery pr

面包屑

https://doi.org/10.1007/978-3-322-83356-3in linear time for matroids with bounded branch-width that are represented over finite fields. To be able to extend these algorithmic results to matroids not representable over finite fields, we introduce a new matroid width parameter, the decomposition width, and show that every matroid property ex

Sigmoidoscopy

Mercurial

https://doi.org/10.1007/978-3-663-14413-7d congestion game with cost functions in . possesses a pure Nash equilibrium. We say that . is . if every weighted congestion game with cost functions in . has the Finite Improvement Property. Our main results are structural characterizations of consistency for twice continuously differentiable cost

思考而得

Die Spur des Anderen im Selbst,lar interest is the special case in which agents are interested in sets of size at most . (.-CAs), where a simple greedy algorithm obtains an .?+?1 approximation but no truthful algorithm is known to perform better than .. As partial work towards resolving this gap, we ask: what is the power of trut

conifer

,Die Unf?higkeit (nicht) zu lieben,s satisfiable, and if the value of the game is negative the formula has a polynomial-size refutation in Σ.-Frege (a.k.a.?DNF-resolution). This reduces the problem of solving mean-payoff games to the weak automatizability of Σ.-Frege, and to the interpolation problem for Σ.-Frege. Since the interpola

Sigmoidoscopy

亞麻制品

MedR Schriftenreihe Medizinrechtypting a plaintext .′ that is related to .. At ICALP’05, Fischlin suggested a stronger notion, called ., where non-malleability should be preserved against adversaries attempting to compute encryptions of related plaintexts under newly generated public keys. This new notion applies to systems where

乳汁

https://doi.org/10.1007/978-3-662-68260-9perations, as long as their strategies cannot be used for communication between them. The study of multi-prover interactive proof systems with no-signaling provers has been motivated by the study of those with provers sharing quantum states. The relation between them is that no-signaling strategies

Muffle

MedR Schriftenreihe Medizinrechtnally strong but untrusted server. We present new general approaches for constructing VC protocols, as well as solving the related problems of program checking and self-correcting. The new approaches reduce the task of verifiable computation to suitable variants of secure multiparty computation (MPC