搜索结果: 1-2 共查到“PPAD hardness”相关记录2条 . 查询时间(0.13 秒)
We prove our result by reducing ff to (a variant of) the SINK-OF-VERIFIABLE-LINE problem, which is known to imply PPAD (and in fact CLS) hardness. The main building block of our reduction is a recentl...
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
SVL Standard Cryptographic Assumptions
2016/4/15
We consider the question of whether average-case PPAD hardness can be based on standard cryptographic assumptions, such as the existence of one-way functions or public-key encryption. This question is...