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

Täydet tiedot

Bibliografiset tiedot
Päätekijät: Deng, X, Zhang, J, Qi, Q, Saberi, A
Aineistotyyppi: Journal article
Kieli:English
Julkaistu: INFORMS 2011

Samankaltaisia teoksia