OpenAlex
PricingAboutJobs
Log inGet started
Work

3 { Nash is PPAD { Complete

HTML

Year: 2005
Type: preprint
Source: Electronic colloquium on computational complexity
Authors: Xi Chen, Xiaotie Deng
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: Nash equilibrium, PPAD-completeness, polynomial-time computability, computational complexity of equilibrium computation, combinatorial games

Open Access status: closed
OpenAlex ID: W42043901
Cites: 9
Cited by: 130
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms