Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{728116,
author = {Fialík, Ivan},
address = {Kyoto, Japonsko},
booktitle = {Asian Conference on Quantum Information Science},
keywords = {pseudo-telepathy games; the Matching Game; classical winning strategies},
language = {eng},
location = {Kyoto, Japonsko},
pages = {28-29},
publisher = {Kyoto University},
title = {Classical Winning Strategies for the Matching Game},
year = {2007}
}
TY - JOUR
ID - 728116
AU - Fialík, Ivan
PY - 2007
TI - Classical Winning Strategies for the Matching Game
PB - Kyoto University
CY - Kyoto, Japonsko
KW - pseudo-telepathy games
KW - the Matching Game
KW - classical winning strategies
N2 - Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of communication required to carry out some distributed problems. We speak of pseudo-telepathy when it is able to completely eliminate the need for communication. The matching game is the newest member of the family of pseudo-telepathy games. After introducing a general model for pseudo-telepathy games, we focus on the question what the smallest size of inputs is for which the matching game is a pseudo-telepathy game.
ER -
FIALÍK, Ivan. Classical Winning Strategies for the Matching Game. In \textit{Asian Conference on Quantum Information Science}. Kyoto, Japonsko: Kyoto University, 2007, s.~28-29.
|
