首页期刊浏览 2025年12月04日星期四

登录注册

全文

	有本地全文	132篇
	有全文链接	2篇

出版年度

	2022	1篇
	2020	4篇
	2019	6篇
	2018	6篇
	2017	2篇

	2016	11篇
	2015	3篇
	2014	10篇
	2013	13篇
	2012	10篇
	2011	6篇
	2010	11篇
	2009	3篇
	2008	7篇
	2007	1篇
	2006	2篇
	2005	1篇
	2002	2篇
	2000	4篇
	1999	12篇
	1998	4篇
	1997	5篇
	1996	6篇
	1995	4篇

作者

	Meena Mahajan	5篇
	Guillaume Malod	3篇
	Ilias Diakonikolas	3篇
	Ishay Haviv	3篇
	John Watrous	3篇

	Moshe Y. Vardi	3篇
	Thomas Thierauf	3篇
	V. Arvind	3篇
	Yehuda Lindell	3篇
	Anish Arora	2篇
	Arkadev Chattopadhyay	2篇
	Ashley Montanaro	2篇
	Ben Fairbairn	2篇
	Dmitry Gavinsky	2篇
	Eric Allender	2篇
	Eric Price	2篇
	Frederic Green	2篇
	Guillaume Lagarde	2篇
	Gus Gutoski	2篇
	Heribert Vollmer	2篇
	Hirotada Kobayashi	2篇
	Jamie Sikora	2篇
	Joan Feigenbaum	2篇
	John Peebles	2篇
	Keiji Matsumoto	2篇
	Maximilien Gadouleau	2篇
	Michael Langberg	2篇
	Nitin Saurabh	2篇
	Oded Regev	2篇
	Peter J. Cameron	2篇
	Raghav Kulkarni	2篇
	Ronald de Wolf	2篇
	Sylvain Perifel	2篇
	Themis Gouleakis	2篇
	Thomas Watson	2篇
	Tom Gur	2篇
	Abhranil Chatterjee	1篇
	Adam R. Day.	1篇
	Adnan Aziz	1篇

来源期刊

Chicago Journal of Theoretical Computer Science

134篇

学科主题

计算技术、计算机技术

134篇

语种

英文

134篇

国别/地区

美国

134篇

检索条件:"( ( 高级检索(( ((JI:("43684"))) )) ) )"

共 134 条记录

排序：全选导出：

1.Learning graph based quantum query algorithms for finding constant-size subgraphs

作　　者：Troy Lee ;Frédéric Magniez ;Miklos Santha

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479182

文章详细全文下载
2.On Quantum Interactive Proofs with Short Messages

作　　者：Attila Pereszlényi

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479183

文章详细全文下载
3.Almost all decision trees do not allow significant quantum speed-up

作　　者：Ashley Montanaro

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479184

文章详细全文下载
4.Computational Models with No Linear Speedup

作　　者：Amir M. Ben-Amram ;Niels H. Christensen ;Jakob Grue Simonsen

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479185

文章详细全文下载
5.Interactive proofs with efficient quantum prover for recursive Fourier sampling

作　　者：Matthew McKague

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479186

文章详细全文下载
6.Best Effort and Priority Queuing Policies for Buffered Crossbar Switches

作　　者：Alex Kesselman ;Kirill Kogan ;Michael Segal

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479187

文章详细全文下载
7.Hardness of the Covering Radius Problem on Lattices

作　　者：Ishay Haviv ;Oded Regev.

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479188

文章详细全文下载
8.Linear cover time for trees is exponentially unlikely

作　　者：Amir Yehudayoff.

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479189

文章详细全文下载
9.Minimum and maximum against $k$ lies

作　　者：Michael Hoffman ;Jiří Matoušek ;Yoshio Okamoto 等

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479190

文章详细全文下载
10.A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem

作　　者：Thomas Vidick.

出　　处：Chicago Journal of Theoretical Computer Science. 2012 ;2012.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479191

文章详细全文下载

1 2 3 4 5 下一页尾页

电话：010-85195300

E-mail：cassoa@cass.org.cn

地址：中国北京建国门内大街5号中国社会科学院1#楼

扫一扫关注微信

联系我们|关于我们|网站声明

国家哲学社会科学文献中心版权所有