مرکز منطقه ای اطلاع رساني علوم و فناوري - A note on the non-NP-hardness of approximate lattice problems under general Cook reductions

Title of article :

A note on the non-NP-hardness of approximate lattice problems under general Cook reductions

Author/Authors :

Jin-Yi Cai، نويسنده , , Ajay Nerurkar، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2000

Pages :

From page :

To page :

Keywords :

Collapse , computational complexity , General Cook reduction , Lattice

Journal title :

Information Processing Letters

Serial Year :

2000

Journal title :

Information Processing Letters

Record number :

129288

Link To Document :