|
|
Venues (Conferences, Journals, ...)
|
|
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 |
29 | Chris Peikert |
Limits on the Hardness of Lattice Problems in lp Norms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(2), pp. 300-351, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
11H06, 94B75, 68Q25, Subject classification. 68Q17 |
29 | Daniele Micciancio |
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(4), pp. 365-411, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
11H06, Subject classification. 68Q17, 94B15 |
29 | Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001 |
The complexity of the covering radius problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(2), pp. 90-121, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
11H06, 11H31, 68Q25, 94B05, Subject classification. 68Q17 |
29 | Jean François Maurras |
From Membership to Separation, a Simple Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(4), pp. 531-536, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05Cxx, 11H06, 11J13 |
Displaying result #1 - #4 of 4 (100 per page; Change: )
|
|