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...

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak: Deng, X, Zhang, J, Qi, Q, Saberi, A
Formatua: Journal article
Hizkuntza:English
Argitaratua: INFORMS 2011

Antzeko izenburuak