Lance Fortnow
Algorithms & Complexity · Computational Complexity · 1991–2009
A researcher in the Science corpus: 5 papers; trusts 6 researchers and is trusted by 9 researchers here, as inferred from the citation graph.
Subfields
- Algorithms & Complexity — 10 citations into it
- Computational Theory and Mathematics — 10 citations into it; #4,063 of 12,182 by trust here, #4,696 by citations
Whom Lance Fortnow trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Sanjeev Arora
- Adi Shamir
- Richard M. Karp
- Joe Kilian
- Michel X. Goemans
- Shafi Goldwasser
- David S. Johnson
- Carsten Lund
- Prasad Raghavendra
- H. Nader
Who trusts Lance Fortnow overall
- Eli Ben-Sasson
- Oded Goldreich
- Alessandro Chiesa
- Srinath T. V. Setty
- Silvio Micali
- Christopher J. Hillar
- Hans L. Bodlaender
- Igor L. Markov
- Dan Boneh
- Manuel Blum
Papers from Lance Fortnow's perspective
Ordered by how strongly the researchers Lance Fortnow trusts endorse each paper. Same corpus, a different order for every researcher.
- ImageNet classification with deep convolutional neural networks
- Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Gradient-based learning applied to document recognition
- Reducibility Among Combinatorial Problems
- Learning Multiple Layers of Features from Tiny Images
- Attention is All you Need (Neural Information Processing Systems)
- Adam: A Method for Stochastic Optimization (International Conference on Learning Representations)
- ImageNet: A large-scale hierarchical image database
- Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift (International Conference on Machine Learning)
Their papers
- Infeasibility of instance compression and succinct PCPs for NP (2007) — 342 citations
- The status of the P versus NP problem (2009) — 337 citations
- Non-deterministic exponential time has two-prover interactive protocols (2005) — 506 citations
- On the Power of Multi-Prover Interactive Protocols (1994)
- Checking computations in polylogarithmic time (1991)