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...
Autors principals: | Deng, X, Zhang, J, Qi, Q, Saberi, A |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
INFORMS
2011
|
Ítems similars
-
Discrete Fixed Points: Models‚ Complexities‚ and Applications
per: Deng, X, et al.
Publicat: (2011) -
Fixed points of log-linear discrete dynamics
per: Ken Sawada, et al.
Publicat: (1997-01-01) -
Multigrid algorithms and complexity results for discrete-time stochastic control and related fixed-point problems
per: Chow, Chee-Seng
Publicat: (2005) -
Direction Preserving Zero Point Computing and Applications
per: Deng, X, et al.
Publicat: (2009) -
Direction preserving zero point computing and applications (Extended abstract)
per: Deng, X, et al.
Publicat: (2009)