Talk:List of PPAD-complete problems

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Hypergraph matching[edit]

I don't know what exactly is "Hypergraph matching", but it currently links to "3-dimensional matching", which is an NP-hard problem. 132.65.120.151 (talk) 14:18, 13 December 2015 (UTC)[reply]