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...
Váldodahkkit: | Deng, X, Zhang, J, Qi, Q, Saberi, A |
---|---|
Materiálatiipa: | Journal article |
Giella: | English |
Almmustuhtton: |
INFORMS
2011
|
Geahča maid
-
Discrete Fixed Points: Models‚ Complexities‚ and Applications
Dahkki: Deng, X, et al.
Almmustuhtton: (2011) -
Fixed points of log-linear discrete dynamics
Dahkki: Ken Sawada, et al.
Almmustuhtton: (1997-01-01) -
Multigrid algorithms and complexity results for discrete-time stochastic control and related fixed-point problems
Dahkki: Chow, Chee-Seng
Almmustuhtton: (2005) -
Direction Preserving Zero Point Computing and Applications
Dahkki: Deng, X, et al.
Almmustuhtton: (2009) -
Direction preserving zero point computing and applications (Extended abstract)
Dahkki: Deng, X, et al.
Almmustuhtton: (2009)