Worst-case to average case reductions for the distance to a code

Leibniz International Proceedings in Informatics, 2018.

Cited by: 11|Views50


Algebraic proof systems reduce computational problems to problems about estimating the distance of a sequence of functions u = ( u1,..., uk), given as oracles, from a linear error correcting code V. The soundness of such systems relies on methods that act "locally" on u and map it to a single function u that is, roughly, as far from V as ...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 280 coins

Wechat's Red Packet

Upload 200 articles

for 1200 coins

Wechat's Red Packet

Upload 500 articles

for 3000 coins

Wechat's Red Packet

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :