Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for 11H06 with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2002 (1) 2005 (1) 2007 (1) 2008 (1)
Publication types (Num. hits)
article(4)
Venues (Conferences, Journals, ...)
Comput. Complex.(3) Comb.(1)
Authors
Daniele Micciancio(2) Chris Peikert(1) Jean François Maurras(1) Oded Regev 0001(1) Venkatesan Guruswami(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 4 keywords
Results
Found 4 publication records. Showing 4 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
29Chris Peikert Limits on the Hardness of Lattice Problems in lp Norms. Search on Bibsonomy Comput. Complex. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF 11H06, 94B75, 68Q25, Subject classification. 68Q17
29Daniele Micciancio Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions. Search on Bibsonomy Comput. Complex. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF 11H06, Subject classification. 68Q17, 94B15
29Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001 The complexity of the covering radius problem. Search on Bibsonomy Comput. Complex. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF 11H06, 11H31, 68Q25, 94B05, Subject classification. 68Q17
29Jean François Maurras From Membership to Separation, a Simple Construction. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000): 05Cxx, 11H06, 11J13
Displaying result #1 - #4 of 4 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license