External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Tree Polymatrix Games Are PPAD-Hard

Argyrios Deligkas, John Fearnley, Rahul Savani. Tree Polymatrix Games Are PPAD-Hard. In Artur Czumaj, Anuj Dawar, Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference). Volume 168 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Authors

Argyrios Deligkas

This author has not been identified. Look up 'Argyrios Deligkas' in Google

John Fearnley

This author has not been identified. Look up 'John Fearnley' in Google

Rahul Savani

This author has not been identified. Look up 'Rahul Savani' in Google
runs on