What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Discrete mathematics (54.00%)
- Combinatorics (42.00%)
- Computational complexity theory (22.80%)
What were the highlights of his more recent work (between 2007-2017)?
- Discrete mathematics (54.00%)
- Combinatorics (42.00%)
- Computational complexity theory (22.80%)
In recent papers he was focusing on the following fields of study:
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.
Between 2007 and 2017, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
