Pairings for cryptographers
- 作者Steven D. Galbraith; Kenneth G. Paterson; Nigel P. Smart
- 卷第156卷
- 期第16期
- 印刷ISSN0166-218X
- 文件大小399.84KB
- 发表时间2008
- DOI10.1016/j.dam.2007.12.010
- 页码3113-3121
同作者推荐
Complexity of hyperconceptsJoel Ratsaby · 2006
On the complexity of binary samplesJoel Ratsaby · 2008
Maximal width learning of binary functionsMartin Anthony; Joel Ratsaby · 2010
On the sysRatio and its critical pointJoel Ratsaby · 2011
On learning multicategory classification with sample queriesJoel Ratsaby · 2003
On the Learnability of Rich Function ClassesJoel Ratsaby; Vitaly Maiorov · 1999
On the algorithmic complexity of static structuresJoel Ratsaby; J. Chaskalovic · 2010