Követés
Lance Fortnow
Lance Fortnow
Illinois Institute of Technology
E-mail megerősítve itt: iit.edu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Algebraic methods for interactive proof systems
C Lund, L Fortnow, H Karloff, N Nisan
Journal of the ACM (JACM) 39 (4), 859-868, 1992
11951992
Non-deterministic exponential time has two-prover interactive protocols
L Babai, L Fortnow, C Lund
Computational complexity 1, 3-40, 1991
10801991
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
8751991
The status of the P versus NP problem
L Fortnow
Communications of the ACM 52 (9), 78-86, 2009
5642009
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
4401993
On the power of multi-prover interactive protocols
L Fortnow, J Rompel, M Sipser
Theoretical Computer Science 134 (2), 545-557, 1994
4331994
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
3772008
The complexity of perfect zero-knowledge
L Fortnow
Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987
3561987
Gap-definable counting classes
SA Fenner, LJ Fortnow, SA Kurtz
Journal of Computer and System Sciences 48 (1), 116-148, 1994
3211994
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
2722001
Random-self-reducibility of complete sets
J Feigenbaum, L Fortnow
SIAM Journal on Computing 22 (5), 994-1005, 1993
2641993
Complexity limitations on quantum computation
L Fortnow, J Rogers
Journal of Computer and System Sciences 59 (2), 240-252, 1999
2451999
Computational identification of operons in microbial genomes
Y Zheng, JD Szustakowski, L Fortnow, RJ Roberts, S Kasif
Genome research 12 (8), 1221-1230, 2002
1992002
A short history of computational complexity
L Fortnow, S Homer
Boston University Computer Science Department, 2003
1852003
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
1612013
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
1261998
Are there interactive protocols for co-NP languages?
L Fortnow, M Sipser
Information Processing Letters 28 (5), 249-251, 1988
1231988
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20