Lance Fortnow

Citata da

	Tutte	Dal 2020
Citazioni	12165	2518
Indice H	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 451 478 469 418 463 464 444 500 508 437 461 491 513 108

Accesso pubblico

Visualizza tutto

11 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftEmail verificata su quantinuum.com
Carsten LundAT&TEmail verificata su att.com
Laszlo BabaiUniversity of ChicagoEmail verificata su cs.uchicago.edu
Rahul SanthanamUniversity of OxfordEmail verificata su cs.ox.ac.uk
Stephen FennerProfessor of Computer Science and Engineering, University of South CarolinaEmail verificata su cec.sc.edu
Stuart KurtzProfessor of Computer Science, The University of ChicagoEmail verificata su cs.uchicago.edu
Ronitt RubinfeldProfessor of Computer Science, MIT and Tel Aviv UniversityEmail verificata su csail.mit.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemEmail verificata su cs.huji.ac.il
Richard BeigelTemple UniversityEmail verificata su temple.edu
John RogersAssociate Professor, DePaul UniversityEmail verificata su depaul.edu
David M PennockProfessor, Rutgers UniversityEmail verificata su dimacs.rutgers.edu
Joan FeigenbaumGrace Murray Hopper Professor of Computer Science, Yale UniversityEmail verificata su yale.edu
Luís AntunesPorto UniversityEmail verificata su dcc.fc.up.pt
Mario SzegedyProfessor of Computer Science, Rutgers UniversityEmail verificata su cs.rutgers.edu
Pavan AduriIowa State UniversityEmail verificata su cs.iastate.edu
Ilan NewmanProfessor of Computer Science, University of HaifaEmail verificata su cs.haifa.ac.il
Tugkan BatuDepartment of Mathematics, London School of EconomicsEmail verificata su lse.ac.uk
Yiling ChenHarvard UniversityEmail verificata su seas.harvard.edu
Sophie LaplanteIRIF, Université Paris CitéEmail verificata su irif.fr
Leonid A. LevinEmail verificata su bu.edu

Segui

Lance Fortnow

Illinois Institute of Technology

Email verificata su iit.edu - Home page

Computational Complexity


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Algebraic methods for interactive proof systems C Lund, L Fortnow, H Karloff, N Nisan Journal of the ACM (JACM) 39 (4), 859-868, 1992	1203	1992
Non-deterministic exponential time has two-prover interactive protocols L Babai, L Fortnow, C Lund Computational complexity 1, 3-40, 1991	1082	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	570	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	490*	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	378	2008
The complexity of perfect zero-knowledge L Fortnow Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987	358	1987
Gap-definable counting classes SA Fenner, LJ Fortnow, SA Kurtz Journal of Computer and System Sciences 48 (1), 116-148, 1994	323	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	274	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	246	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	199	2002
A short history of computational complexity L Fortnow, S Homer Boston University Computer Science Department, 2003	186	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

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori