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
6
From page
61
To page
66
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