Polynomial-factor hardness of general lattice problems
Statement
Prove that general SVP and SIVP are hard in the worst case to approximate within small polynomial factors.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.