[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jacm/Khot05>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Subhash_Khot>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F1089023.1089027>
foaf:homepage <https://doi.org/10.1145/1089023.1089027>
dc:identifier DBLP journals/jacm/Khot05 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F1089023.1089027 (xsd:string)
dcterms:issued 2005 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jacm>
rdfs:label Hardness of approximating the shortest vector problem in lattices. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Subhash_Khot>
swrc:number 5 (xsd:string)
swrc:pages 789-808 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jacm/Khot05/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jacm/Khot05>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jacm/jacm52.html#Khot05>
rdfs:seeAlso <https://doi.org/10.1145/1089023.1089027>
dc:subject Approximation algorithms, cryptography, hardness of approximation, lattices, shortest vector problem (xsd:string)
dc:title Hardness of approximating the shortest vector problem in lattices. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 52 (xsd:string)