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...

詳細記述

書誌詳細
主要な著者: Deng, X, Qi, Q, Zhang, J
フォーマット: Conference item
言語:English
出版事項: Springer Berlin Heidelberg 2009