Lance Fortnow

Citeras av

	Alla	Sedan 2020
Citat	12145	2497
h-index	50	23
i10-index	113	47

520

260

130

390

19901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202569 121 120 145 220 194 168 208 240 249 179 208 166 320 322 344 342 382 374 361 476 457 450 478 469 418 463 465 444 500 505 437 461 490 512 92

Offentlig åtkomst

Visa alla

11 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftVerifierad e-postadress på quantinuum.com
Carsten LundAT&TVerifierad e-postadress på att.com
Laszlo BabaiUniversity of ChicagoVerifierad e-postadress på cs.uchicago.edu
Rahul SanthanamUniversity of OxfordVerifierad e-postadress på cs.ox.ac.uk
Stephen FennerProfessor of Computer Science and Engineering, University of South CarolinaVerifierad e-postadress på cec.sc.edu
Stuart KurtzProfessor of Computer Science, The University of ChicagoVerifierad e-postadress på cs.uchicago.edu
Ronitt RubinfeldProfessor of Computer Science, MIT and Tel Aviv UniversityVerifierad e-postadress på csail.mit.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerifierad e-postadress på cs.huji.ac.il
Richard BeigelTemple UniversityVerifierad e-postadress på temple.edu
John RogersAssociate Professor, DePaul UniversityVerifierad e-postadress på depaul.edu
David M PennockProfessor, Rutgers UniversityVerifierad e-postadress på dimacs.rutgers.edu
Joan FeigenbaumGrace Murray Hopper Professor of Computer Science, Yale UniversityVerifierad e-postadress på yale.edu
Luís AntunesPorto UniversityVerifierad e-postadress på dcc.fc.up.pt
Mario SzegedyProfessor of Computer Science, Rutgers UniversityVerifierad e-postadress på cs.rutgers.edu
Pavan AduriIowa State UniversityVerifierad e-postadress på cs.iastate.edu
Ilan NewmanProfessor of Computer Science, University of HaifaVerifierad e-postadress på cs.haifa.ac.il
Tugkan BatuDepartment of Mathematics, London School of EconomicsVerifierad e-postadress på lse.ac.uk
Yiling ChenHarvard UniversityVerifierad e-postadress på seas.harvard.edu
Sophie LaplanteIRIF, Université Paris CitéVerifierad e-postadress på irif.fr
Leonid A. LevinVerifierad e-postadress på bu.edu

Följ

Lance Fortnow

Illinois Institute of Technology

Verifierad e-postadress på iit.edu - Startsida

Computational Complexity


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Algebraic methods for interactive proof systems C Lund, L Fortnow, H Karloff, N Nisan Journal of the ACM (JACM) 39 (4), 859-868, 1992	1201	1992
Non-deterministic exponential time has two-prover interactive protocols L Babai, L Fortnow, C Lund Computational complexity 1, 3-40, 1991	1081	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	877	1991
The status of the P versus NP problem L Fortnow Communications of the ACM 52 (9), 78-86, 2009	567	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	488*	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	440	1993
On the power of multi-prover interactive protocols L Fortnow, J Rompel, M Sipser Theoretical Computer Science 134 (2), 545-557, 1994	433	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	379	2008
The complexity of perfect zero-knowledge L Fortnow Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987	357	1987
Gap-definable counting classes SA Fenner, LJ Fortnow, SA Kurtz Journal of Computer and System Sciences 48 (1), 116-148, 1994	322	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	272	2001
Random-self-reducibility of complete sets J Feigenbaum, L Fortnow SIAM Journal on Computing 22 (5), 994-1005, 1993	264	1993
Complexity limitations on quantum computation L Fortnow, J Rogers Journal of Computer and System Sciences 59 (2), 240-252, 1999	245	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	200	2002
A short history of computational complexity L Fortnow, S Homer Boston University Computer Science Department, 2003	185	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	170*	2010
The golden ticket: P, NP, and the search for the impossible L Fortnow The Golden Ticket, 2013	161	2013
Arithmetization: A new method in structural complexity theory L Babai, L Fortnow computational complexity 1, 41-66, 1991	142*	1991
Nonrelativizing separations H Buhrman, L Fortnow, T Thierauf Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity …, 1998	126	1998
Are there interactive protocols for co-NP languages? L Fortnow, M Sipser Information Processing Letters 28 (5), 249-251, 1988	124	1988

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare