Direction preserving zero point computing and applications (Extended abstract)
We study the connection between the direction preserving zero point and the discrete Brouwer fixed point in terms of their computational complexity. As a result, we derive a PPAD-completeness proof for computing direction preserving zero point, and a matching oracle complexity bound for discrete Bro...
Main Authors: | Deng, X, Qi, Q, Zhang, J |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Springer Berlin Heidelberg
2009
|
Similar Items
-
Direction Preserving Zero Point Computing and Applications
by: Deng, X, et al.
Published: (2009) -
Directed model checking with distance−preserving abstractions
by: Dräger, K, et al.
Published: (2009) -
Directed Model Checking with Distance−Preserving Abstractions
by: Dräger, K, et al.
Published: (2006) -
Use of semantic technologies to inform progress toward zero-carbon economy - Extended abstract
by: Germano, S, et al.
Published: (2021) -
Extended Abstracts
Published: (2017-08-01)