Why extension-based proofs fail
STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing Phoenix AZ USA June, 2019(2023)
摘要
We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k >= 2 processes or approximate agreement on a cycle of length 4 among n > 2 processes in a wait-free manner in asynchronous models where processes communicate using objects that can be constructed from shared registers. However, it was unknown whether proofs based on simpler techniques were possible. We show that these impossibility results cannot be obtained by extension-based proofs in the iterated snapshot model and, hence, extension-based proofs are limited in power.
更多查看译文
关键词
set agreement,impossibility proofs,valency arguments,combinatorial topology
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络