10,652 Hits in 7.6 sec

Lower Bound for the Communication Complexity of the Russian Cards Problem [article]

Aiswarya Cyriac, K. Murali Krishnan
2008 arXiv   pre-print
The proof demonstrates the utility of DEL in proving lower bounds for communication protocols.  ...  In this paper it is shown that no public announcement scheme that can be modeled in Dynamic Epistemic Logic (DEL) can solve the Russian Cards Problem (RCP) in one announcement.  ...  Ramanujam for introducing her to the Russian cards problem.  ... 
arXiv:0805.1974v2 fatcat:r4wjlg35wzcflmjwpccbt5vthq

Page 469 of Mathematical Reviews Vol. , Issue 96a [page]

1996 Mathematical Reviews  
It is shown that the communication complexity of the problem is @(n? log p).  ...  The author characterizes bases for which one could hope to obtain nonlinear lower bounds on the formula complexity of explicit sequences of Boolean functions.  ... 

Page 2253 of Mathematical Reviews Vol. 52, Issue 6 [page]

1976 Mathematical Reviews  
A lower bound due to Winograd on the number of scalar multiplications needed for matrix multiplication is proven, as well as a lower bound of the author for Boolean matrix products using monotone opera  ...  An information theoretic lower bound on the average number of ternary comparisons for sorting S is obtained which is close to the above upper bound.  ... 

Page 2557 of Mathematical Reviews Vol. 57, Issue 6 [page]

1979 Mathematical Reviews  
With regard to noise channels, upper bounds for the achievable rate region are revised to others, while new lower bounds result.  ...  M. 57 #19081 Upper bounds for the number of points of a binary code with a given code distance. (Russian) Problemy Peredaéi Informacii 10 (1974), no. 2, 43-51.  ... 

Page 480 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
The study of the communication complexity of concrete problems has been very useful in prov- ing lower bounds on several fundamental complexity measures of these problems, especially in the area of parallel  ...  Three different methods for proving lower bounds on one-way probabilistic communication complexity are presented and compared.  ... 

A case study in almost-perfect security for unconditionally secure communication

Esteban Landerreche, David Fernández-Duque
2016 Designs, Codes and Cryptography  
In the Russian cards problem, Alice, Bob and Cath draw a, b and c cards, respectively, from a publicly known deck.  ...  Alice and Bob must then communicate their cards to each other without Cath learning who holds a single card.  ...  Acknowledgements We are grateful to Geertrui van de Voorde and Klaus Metsch for their comments, which led to the bounds of Sect. 7.  ... 
doi:10.1007/s10623-016-0210-y fatcat:bd3iidatefboxe4yh3mmv6xrwu

A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems [article]

Sergio Rajsbaum
2020 arXiv   pre-print
In one extreme, the generalized Russian cards problem, B wants to learn all of A's cards, and in the other, B wishes to learn something about A's hand.  ...  There is a publicly known signature (a,b,c), where n = a + b + c + r, and A gets a cards, B gets b cards, and C gets c cards, out of the deck of n cards.  ...  Acknowledgements We would like to thank Zoe Leyva-Acosta and Eduardo Pascual-Aseff for their many comments, and for finding the 2-message minimally informative solution to the Russian cards problem.  ... 
arXiv:2009.13644v1 fatcat:73fa4vy64bgipjp2zpb2ajvx4e

A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem [chapter]

Pierre-Louis Cayrel, Pascal Véron, Sidi Mohamed El Yousfi Alaoui
2011 Lecture Notes in Computer Science  
In this paper, we propose a 5-pass code-based protocol with a lower communication complexity, allowing an impersonator to succeed with only a probability of 1/2.  ...  fields Fq; the public data of our construction is then 4 Kbytes, whereas that of Stern's scheme is 15 Kbytes for the same level of security.  ...  However, this variant slightly increases the probability of cheating rather than lowering it, and thus increases the communication complexity.  ... 
doi:10.1007/978-3-642-19574-7_12 fatcat:fgusbrhhxzhu7axnzatazdj55a

Page 2812 of Mathematical Reviews Vol. , Issue 87e [page]

1987 Mathematical Reviews  
The lower bound (see Theorem 2) has dimension n and minimal distance d as parameters.”  ...  Connections are observed with binary code theory and therefore the two classical combinatorial functions A(n,d) and A(n,d,w) appear in the lower bound obtained for the cardinality of optimal spherical  ... 

Secure Communication of Local States in Interpreted Systems [chapter]

Michael Albert, Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano
2011 Advances in Intelligent and Soft Computing  
For card deals, the problem to keep all of your cards a secret (i) can be distinguished from the problem to keep some of your cards a secret (ii).  ...  For (ii): we show that the problem to keep at least one of your cards a secret is equivalent to the problem to keep your local state (hand of cards) a secret; we provide a large class of card deals for  ...  Acknowledgement We thank Marco Vervoort for first proving an n + 1 lower bound version of Proposition 5. We thank the PAAMS anonymous reviewers for their comments.  ... 
doi:10.1007/978-3-642-19934-9_15 dblp:conf/dcai/AlbertCDDJS11 fatcat:cvduadndhral3nl56ntdojesie

Model Checking Russian Cards

H.P. van Ditmarsch, W. van der Hoek, R. van der Meyden, J. Ruan
2006 Electronical Notes in Theoretical Computer Science  
A typical example is 'Russian Cards': two players each draw three cards from a pack of seven cards, and the remaining player (eavesdropper) * This research is carried out with support from AOARD research  ...  We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results.  ...  Conclusions We have implemented the five hand protocol to solve the Russian Cards problem in the model checkers MCK, DEMO, and MCMAS.  ... 
doi:10.1016/j.entcs.2005.07.029 fatcat:fxgfohpvajh6tegi5omgyldqby

Page 1246 of Mathematical Reviews Vol. , Issue 91B [page]

1991 Mathematical Reviews  
We obtain a worst-case lower bound on the algorithm time that co- incides (up to a constant factor) with a known upper bound.  ...  a generalized factorization problem for structurally passive synthesis of digital filters.  ... 

Classification practice in the USSR. Current status and development trends

E.R. Sukiasyan
1988 Knowledge organization  
The problems of interaction of the classification systems arc studied in the present article.  ...  The great possibilities of LBe application from the point of view of automatic searching arc discussed.  ...  The growning numbers of extensions and corrections has confronted the specialists with a number of complex problems, since the variants of the LBC tables (for regional, public, children's and school libraries  ... 
doi:10.5771/0943-7444-1988-2-69 fatcat:6jsxz26imzcm5hzbkl4th66co4

An Uncertain Belonging

Halie Craig
2014 Cornell international affairs review  
He said, "The Christians are not the problem. We can come to agreement with them. The central problem is the Muslim Arabs, and Muslim Arab nationalism.  ...  permits for checkpoints and roads, East Jerusalem's Palestinians are ANY WAY IT IS EXAMINED, THE FORMATION OF AN OVERALL PALESTINIAN IDENTITY IS A WEIGHTY AND COMPLEX ISSUE 51 V.7 II 50 CIAR  ... 
doi:10.37513/ciar.v7i2.455 fatcat:pe5h4yxuhjdptbwuj3oja3nvte

Lower bound for the cost of connecting tree with given vertex degree sequence [article]

Mikhail Goubko, Alexander Kuznetsov
2018 arXiv   pre-print
For the case of connecting trees with the given sequence of vertex degrees, the cost of the optimal tree is shown to be bounded from below by the solution of a semidefinite optimization program with bilinear  ...  The proposed lower bound estimate is used to construct several heuristic algorithms and to evaluate their quality on a variety of generated and real-life data sets.  ...  However, calculation of the lower bound for huge trees with thousands vertices is still an open problem, which can be the subject of future research.  ... 
arXiv:1808.06199v2 fatcat:v5l2zfmgrfa3th7vlwzbgthguu
« Previous Showing results 1 — 15 out of 10,652 results