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
|
Схожие документы
-
Discrete Fixed Points: Models‚ Complexities‚ and Applications
по: Deng, X, и др.
Опубликовано: (2011) -
Fixed points of log-linear discrete dynamics
по: Ken Sawada, и др.
Опубликовано: (1997-01-01) -
Multigrid algorithms and complexity results for discrete-time stochastic control and related fixed-point problems
по: Chow, Chee-Seng
Опубликовано: (2005) -
Direction Preserving Zero Point Computing and Applications
по: Deng, X, и др.
Опубликовано: (2009) -
Direction preserving zero point computing and applications (Extended abstract)
по: Deng, X, и др.
Опубликовано: (2009)