Other formats:
BibTeX
LaTeX
RIS
@inproceedings{728112,
author = {Fialík, Ivan},
address = {Brno, Czech Republic},
booktitle = {MEMICS 2007: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science},
keywords = {pseudo-telepathy games; the Matching Game; classical winning strategies},
language = {eng},
location = {Brno, Czech Republic},
isbn = {978-80-7355-077-6},
pages = {35-42},
publisher = {Masaryk University and Technical University of Brno},
title = {Classical Winning Strategies for the Matching Game},
year = {2007}
}
TY - JOUR
ID - 728112
AU - Fialík, Ivan
PY - 2007
TI - Classical Winning Strategies for the Matching Game
PB - Masaryk University and Technical University of Brno
CY - Brno, Czech Republic
SN - 9788073550776
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{MEMICS 2007: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science}. Brno, Czech Republic: Masaryk University and Technical University of Brno, 2007, p.~35-42. ISBN~978-80-7355-077-6.
|
