Matches in DBpedia 2016-04 for { <http://doi.org/10.1137/s0097539700373039> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- s0097539700373039 date "2001-01-01".
- s0097539700373039 doi "10.1137/S0097539700373039".
- s0097539700373039 first "D.".
- s0097539700373039 first "Daniele".
- s0097539700373039 isCitedBy Lattice_problem.
- s0097539700373039 isCitedBy Ring_Learning_with_Errors.
- s0097539700373039 issn "0097-5397".
- s0097539700373039 issue "6".
- s0097539700373039 journal "SIAM Journal on Computing".
- s0097539700373039 last "Micciancio".
- s0097539700373039 pages "2008–2035".
- s0097539700373039 title "The Shortest Vector Problem is {NP}-hard to approximate to within some constant".
- s0097539700373039 title "The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant".
- s0097539700373039 url "http://epubs.siam.org/doi/abs/10.1137/S0097539700373039".
- s0097539700373039 url SVP.html.
- s0097539700373039 volume "30".
- s0097539700373039 year "2001".