- Home
- Best Scientists - Computer Science
- Lance Fortnow

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
44
Citations
10,176
165
World Ranking
4746
National Ranking
2372

2007 - ACM Fellow For contributions to complexity theory.

- Algorithm
- Computational complexity theory
- Discrete mathematics

His primary areas of investigation include Discrete mathematics, Theoretical computer science, Computational complexity theory, Combinatorics and Interactive proof system. Lance Fortnow interconnects Class and Quantum complexity theory in the investigation of issues within Discrete mathematics. The Theoretical computer science study combines topics in areas such as Gas meter prover, Proof of knowledge, Proof assistant and Cryptography.

The various areas that Lance Fortnow examines in his Computational complexity theory study include NP and Turing machine. Lance Fortnow works mostly in the field of Combinatorics, limiting it down to topics relating to Upper and lower bounds and, in certain cases, Sublinear function, Distribution and Time complexity. His Interactive proof system research includes elements of Polynomial and Probabilistically checkable proof.

- Non-deterministic exponential time has two-prover interactive protocols (565 citations)
- Algebraic methods for interactive proof systems (537 citations)
- Checking computations in polylogarithmic time (514 citations)

Lance Fortnow mostly deals with Discrete mathematics, Combinatorics, Computational complexity theory, Time complexity and Kolmogorov complexity. His studies in Discrete mathematics integrate themes in fields like Hierarchy, Polynomial and Oracle. Lance Fortnow usually deals with Combinatorics and limits it to topics linked to PSPACE and Time hierarchy theorem and Turing reduction.

His work deals with themes such as Computation, Set, Pseudorandom number generator and Artificial intelligence, which intersect with Computational complexity theory. Lance Fortnow studied Time complexity and Turing machine that intersect with Theoretical computer science. His Kolmogorov complexity research is multidisciplinary, relying on both String, Structural complexity theory and Bounded function.

- Discrete mathematics (54.00%)
- Combinatorics (42.00%)
- Computational complexity theory (22.80%)

- Discrete mathematics (54.00%)
- Combinatorics (42.00%)
- Computational complexity theory (22.80%)

Lance Fortnow focuses on Discrete mathematics, Combinatorics, Computational complexity theory, Polynomial and Advice. His Discrete mathematics study combines topics in areas such as Current and Exponential function. His studies in Combinatorics integrate themes in fields like Small number, PSPACE, Distribution, Bounded function and Upper and lower bounds.

His studies deal with areas such as Reduction, Open problem and Algorithm as well as Bounded function. His work carried out in the field of Computational complexity theory brings together such families of science as Disjoint sets, Measure and Permutation. His Polynomial study incorporates themes from Polynomial hierarchy, Set theory and Binary strings.

- Infeasibility of instance compression and succinct PCPs for NP (230 citations)
- The status of the P versus NP problem (181 citations)
- Testing Closeness of Discrete Distributions (114 citations)

- Algorithm
- Computational complexity theory
- Discrete mathematics

Lance Fortnow mainly investigates Discrete mathematics, Combinatorics, Computational complexity theory, Upper and lower bounds and Open problem. Lance Fortnow has included themes like PSPACE and Polynomial in his Discrete mathematics study. The study incorporates disciplines such as Normal-form game, Canonical form and Invariant in addition to Combinatorics.

The Computational complexity theory study combines topics in areas such as Outcome, Mathematical problem and Limit, Calculus. As a part of the same scientific family, Lance Fortnow mostly works in the field of Upper and lower bounds, focusing on Distribution and, on occasion, Binary logarithm. The concepts of his Open problem study are interwoven with issues in Reduction and Bounded function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Algebraic methods for interactive proof systems

Carsten Lund;Lance Fortnow;Howard Karloff;Noam Nisan.

Journal of the ACM **(1992)**

964 Citations

Algebraic methods for interactive proof systems

Carsten Lund;Lance Fortnow;Howard Karloff;Noam Nisan.

Journal of the ACM **(1992)**

964 Citations

Non-deterministic exponential time has two-prover interactive protocols

L. Babai;L. Babai;L. Fortnow;C. Lund.

Computational Complexity **(1992)**

957 Citations

Non-deterministic exponential time has two-prover interactive protocols

L. Babai;L. Babai;L. Fortnow;C. Lund.

Computational Complexity **(1992)**

957 Citations

Checking computations in polylogarithmic time

László Babai;Lance Fortnow;Leonid A. Levin;Mario Szegedy.

symposium on the theory of computing **(1991)**

747 Citations

Checking computations in polylogarithmic time

László Babai;Lance Fortnow;Leonid A. Levin;Mario Szegedy.

symposium on the theory of computing **(1991)**

747 Citations

The status of the P versus NP problem

Lance Fortnow.

Communications of The ACM **(2009)**

439 Citations

The status of the P versus NP problem

Lance Fortnow.

Communications of The ACM **(2009)**

439 Citations

On the power of multi-prover interactive protocols

Lance Fortnow;John Rompel;Michael Sipser.

Theoretical Computer Science **(1994)**

404 Citations

On the power of multi-prover interactive protocols

Lance Fortnow;John Rompel;Michael Sipser.

Theoretical Computer Science **(1994)**

404 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of Amsterdam

Temple University

University of Chicago

Yale University

MIT

The University of Texas at Austin

Harvard University

AT&T (United States)

University of California, San Diego

Victoria University of Wellington

Nanyang Technological University

Aarhus University

University of Pittsburgh

Princeton University

Istanbul Technical University

Purdue University West Lafayette

Örebro University

Brown University

University of British Columbia

Netherlands Environmental Assessment Agency

International Centre for Theoretical Physics

Complutense University of Madrid

University of California, Los Angeles

Université Catholique de Louvain

University of Tübingen

Florida International University

Something went wrong. Please try again later.