Lance Fortnow

引用先

	すべて	2019 年以来
引用	11963	2876
h 指標	49	24
i10 指標	112	55

520

260

130

390

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202467 116 114 145 214 192 171 212 242 245 177 202 169 307 305 328 342 379 374 362 463 461 450 473 462 421 475 467 449 492 506 435 465 501 477

オープンアクセス

すべて表示

11 件の論文

0 件の論文

利用可能

利用不可

助成機関の要件に基づく

共著者

Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoft確認したメールアドレス: quantinuum.com
Laszlo BabaiUniversity of Chicago確認したメールアドレス: cs.uchicago.edu
Rahul SanthanamUniversity of Oxford確認したメールアドレス: cs.ox.ac.uk
Stephen FennerProfessor of Computer Science and Engineering, University of South Carolina確認したメールアドレス: cec.sc.edu
Stuart KurtzProfessor of Computer Science, The University of Chicago確認したメールアドレス: cs.uchicago.edu
Ronitt RubinfeldProfessor of Computer Science, MIT and Tel Aviv University確認したメールアドレス: csail.mit.edu
Noam NisanProfessor of Computer Science, Hebrew University of Jerusalem確認したメールアドレス: cs.huji.ac.il
Richard BeigelTemple University確認したメールアドレス: temple.edu
John RogersAssociate Professor, DePaul University確認したメールアドレス: depaul.edu
David M PennockProfessor, Rutgers University確認したメールアドレス: dimacs.rutgers.edu
Joan FeigenbaumGrace Murray Hopper Professor of Computer Science, Yale University確認したメールアドレス: yale.edu
Luís AntunesPorto University確認したメールアドレス: dcc.fc.up.pt
Mario SzegedyProfessor of Computer Science, Rutgers University確認したメールアドレス: cs.rutgers.edu
Pavan AduriIowa State University確認したメールアドレス: cs.iastate.edu
Ilan NewmanProfessor of Computer Science, University of Haifa確認したメールアドレス: cs.haifa.ac.il
Tugkan BatuDepartment of Mathematics, London School of Economics確認したメールアドレス: lse.ac.uk
Yiling ChenHarvard University確認したメールアドレス: seas.harvard.edu
Sophie LaplanteIRIF, Université Paris Cité確認したメールアドレス: irif.fr
Leonid A. Levin確認したメールアドレス: bu.edu
Frank StephanNational University of Singapore, Department of Mathematics and Department of Computer Science確認したメールアドレス: comp.nus.edu.sg

フォロー

Lance Fortnow

Illinois Institute of Technology

確認したメールアドレス: iit.edu - ホームページ

Computational Complexity


タイトル引用回数順公開年順タイトル順	引用先引用先	年
Algebraic methods for interactive proof systems C Lund, L Fortnow, H Karloff, N Nisan Journal of the ACM (JACM) 39 (4), 859-868, 1992	1162	1992
Non-deterministic exponential time has two-prover interactive protocols L Babai, L Fortnow, C Lund Computational complexity 1, 3-40, 1991	1055	1991
Checking computations in polylogarithmic time L Babai, L Fortnow, LA Levin, M Szegedy Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991	858	1991
The status of the P versus NP problem L Fortnow Communications of the ACM 52 (9), 78-86, 2009	549	2009
Testing closeness of discrete distributions T Batu, L Fortnow, R Rubinfeld, WD Smith, P White Journal of the ACM (JACM) 60 (1), 1-25, 2013	485*	2013
BPP has subexponential time simulations unless EXPTIME has publishable proofs L aszl o Babai, L Fortnow, N Nisan, A Wigderson Computational Complexity 3 (4), 307-318, 1993	434	1993
On the power of multi-prover interactive protocols L Fortnow, J Rompel, M Sipser Theoretical Computer Science 134 (2), 545-557, 1994	423	1994
Infeasibility of instance compression and succinct PCPs for NP L Fortnow, R Santhanam Proceedings of the fortieth annual ACM symposium on Theory of computing, 133-142, 2008	376	2008
The complexity of perfect zero-knowledge L Fortnow Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987	348	1987
Gap-definable counting classes SA Fenner, LJ Fortnow, SA Kurtz Journal of Computer and System Sciences 48 (1), 116-148, 1994	318	1994
Testing random variables for independence and identity T Batu, E Fischer, L Fortnow, R Kumar, R Rubinfeld, P White Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 442-451, 2001	267	2001
Random-self-reducibility of complete sets J Feigenbaum, L Fortnow SIAM Journal on Computing 22 (5), 994-1005, 1993	253	1993
Complexity limitations on quantum computation L Fortnow, J Rogers Journal of Computer and System Sciences 59 (2), 240-252, 1999	244	1999
Computational identification of operons in microbial genomes Y Zheng, JD Szustakowski, L Fortnow, RJ Roberts, S Kasif Genome research 12 (8), 1221-1230, 2002	198	2002
A short history of computational complexity L Fortnow, S Homer Bulletin of the EATCS 80 (01), 2003, 2003	184	2003
Gaming prediction markets: Equilibrium strategies with a market maker Y Chen, S Dimitrov, R Sami, DM Reeves, DM Pennock, RD Hanson, ... Algorithmica 58, 930-969, 2010	167*	2010
The golden ticket: P, NP, and the search for the impossible L Fortnow Princeton University Press, 2013	151	2013
Arithmetization: A new method in structural complexity theory L Babai, L Fortnow computational complexity 1, 41-66, 1991	141*	1991
Nonrelativizing separations H Buhrman, L Fortnow, T Thierauf Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity …, 1998	121	1998
Are there interactive protocols for co-NP languages? L Fortnow, M Sipser Information Processing Letters 28 (5), 249-251, 1988	120	1988

現在システムで処理を実行できません。しばらくしてからもう一度お試しください。

論文 1–20

年間引用数

重複した引用

結合された引用

共著者を追加共著者

フォロー

引用先

共著者