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...
Päätekijät: | Deng, X, Zhang, J, Qi, Q, Saberi, A |
---|---|
Aineistotyyppi: | Journal article |
Kieli: | English |
Julkaistu: |
INFORMS
2011
|
Samankaltaisia teoksia
-
Discrete Fixed Points: Models‚ Complexities‚ and Applications
Tekijä: Deng, X, et al.
Julkaistu: (2011) -
Fixed points of log-linear discrete dynamics
Tekijä: Ken Sawada, et al.
Julkaistu: (1997-01-01) -
Multigrid algorithms and complexity results for discrete-time stochastic control and related fixed-point problems
Tekijä: Chow, Chee-Seng
Julkaistu: (2005) -
Direction Preserving Zero Point Computing and Applications
Tekijä: Deng, X, et al.
Julkaistu: (2009) -
Direction preserving zero point computing and applications (Extended abstract)
Tekijä: Deng, X, et al.
Julkaistu: (2009)