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: | , , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
Springer Berlin Heidelberg
2009
|