维普期刊资源整合服务平台（V6.5）

42篇 您的检索式：期刊名="computational complexity"

选中清除导出查看参考文献查看引证文献引用追踪共3页首页上一页第1页下一页末页 /3 跳转

	题名	作者	年代	出处	被引量
1	Super-exponential complexity of Presburger arithmetic显示文摘	FISCHER M J RABIN M O	1974	Complexity of Computation 7 AMS Providence RI1974，1974，：	1
2	Computing Frobenius maps and factoring polynomials显示文摘	Joachim Gathen Victor Shoup	1992	Computational Complexity1992，，3：	1
3	Generalized compact knapsacks,cyclic lattices,and effcient one-way functions显示文摘	MICCIANCIO D	1997	Computational Complexity1997，16，4：	1
4	Application of fuzzy inference tech- niques to FMEA 显示文摘	TAY K M LIM C P	2006	Applied Soft Computing Technologies : The Challenge of Complexity2006，34，：	1
5	String matching and other products 显示文摘	Fischer M J Paterson M S	1974	Complexity of computation Massachusetts Institute of Technology1974，7，：	1
6	On the complexity of approxi- mating k-set packing显示文摘	Hazan E Safra S Schwartz O	2006	Computational Complexity2006，，：	1
7	Improved lowdensity subset sum algorithms显示文摘	COSTER M J JOUX A LAMACCHIA B A	1992	Computational Complexity1992，2，2：	1
8	On the Complexity of Numerical Analysis 显示文摘	Vallender E Btirgisser P Kjeldgaard-Pedersen J	2006	IEEE Conference on Computational Complexity2006，，：	1
9	The complexity of semilinear problems in succinct representation 显示文摘	Burgisser P Cucker F Jacobe de Naurois P	2006	Computational Complexity2006，15，3：	1
10	On the hardness of approximating muhicut and sparsest- cut显示文摘	CHAWLA S KRAUTHGAMER R KUMAR R	2006	Computational Complexity2006，15，2：	1
11	Improved low-density subset sum algorithms显示文摘	Coster M J Joux A LaMacchia B A	1992	Computational Complexity1992，2，：	1
12	Generalized compact knapsacks, cyclic lattices, and effcient onewayfunctions显示文摘	Micciancio D	2007	Computational Complexity2007，16，4：	1
13	Reducibility among combinatorial problems显示文摘	Karp R M	1972	Complexity of Computer Computations1972，40，4：	1
14	Visual cryptography for general access structures显示文摘	Blundo G Santis A D	1996	Electronic Colloquium on Computational Complexity1996，129，2：	1
15	Limits on the Hardness of Lattice Problems in ? p Norms显示文摘	Chris Peikert	2008	computational complexity2008，，2：	1
16	Improved low-density subset sum algorithms显示文摘	Matthijs J. Coster Antoine Joux Brian A. LaMacchia Andrew M. Odlyzko Claus-Peter Schnorr Jacques Stern	1992	Computational Complexity1992，，2：	1
17	Mnltiparty Quantum Coin Flipping显示文摘	AMDRIS A BUHRMAN H DODIS Y	2004	IEEE Annual Conference on Computational Complexity2004，，4：	1
18	Improved low-densi- ty subset sum algorithms 显示文摘	Coster M J Joux A LaMacehia B A	1992	Computational Complexity1992，2，2：	1
19	Reducibility Among Combinatorial Problems显示文摘	KARP R M	1972	Complexity of Computer Computations1972，43，4：	1
20	Reducibility among combinatorial problems显示文摘		1972	Complexity Computer Computations1972，，：	1

返回顶部每页显示：

共3页首页上一页第1页下一页末页 /3 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示