Discrete fixed points: models, complexities, and applications

We study three discrete fixed point concept (SPERNER, DPZP, BROUWER) under two different models: the polynomial-time function model and the oracle function model. We fully characterize the computational complexities of these three problems. The computational complexity unification of the above probl...

詳細記述

書誌詳細
主要な著者: Deng, X, Zhang, J, Qi, Q, Saberi, A
フォーマット: Journal article
言語:English
出版事項: INFORMS 2011

類似資料