What is he best known for?
The fields of study he is best known for:
- Algorithm
- Programming language
- Algebra
His primary areas of investigation include Discrete mathematics, Combinatorics, Binary logarithm, Computation and Theoretical computer science.
He mostly deals with Polynomial-time reduction in his studies of Discrete mathematics.
The study incorporates disciplines such as NP-easy, PP, P versus NP problem, PSPACE-complete and Function problem in addition to Polynomial-time reduction.
The Combinatorics study which covers Function that intersects with Logarithm, Random-access machine, Affine logic and Cobham's thesis.
The Binary logarithm study combines topics in areas such as Sorting and Polynomial time complexity.
The various areas that Stephen A. Cook examines in his Theoretical computer science study include Asymptotic computational complexity, Computational resource, Worst-case complexity and Average-case complexity.
His most cited work include:
- The complexity of theorem-proving procedures (5026 citations)
- The relative efficiency of propositional proof systems (658 citations)
- A taxonomy of problems with fast parallel algorithms (579 citations)
What are the main themes of his work throughout his whole career to date?
Stephen A. Cook mainly investigates Discrete mathematics, Combinatorics, Complexity class, Function and Time complexity.
Stephen A. Cook studies Discrete mathematics, focusing on Binary logarithm in particular.
His Combinatorics research is multidisciplinary, relying on both Nondeterministic algorithm and Turing machine.
His Complexity class research focuses on subjects like Bipartite graph, which are linked to Matching.
His Function research incorporates themes from Characterization, Limit, Communication complexity, Stack and Corollary.
His studies examine the connections between Time complexity and genetics, as well as such issues in Computable function, with regards to Computability.
He most often published in these fields:
- Discrete mathematics (66.46%)
- Combinatorics (26.58%)
- Complexity class (19.62%)
What were the highlights of his more recent work (between 2009-2021)?
- Discrete mathematics (66.46%)
- Complexity class (19.62%)
- Function (16.46%)
In recent papers he was focusing on the following fields of study:
Discrete mathematics, Complexity class, Function, Proof complexity and Algebra are his primary areas of study.
He combines subjects such as Mathematical proof, Proof theory and Combinatorics with his study of Discrete mathematics.
Stephen A. Cook has researched Combinatorics in several fields, including Nondeterministic algorithm and Binary decision diagram.
His Complexity class study integrates concerns from other disciplines, such as Disjoint sets, Jordan curve theorem and Limit.
His Function research also works with subjects such as
- Conjecture which is related to area like Characterization and Intersection,
- Stack which intersects with area such as P and Oracle.
His research investigates the connection between Proof complexity and topics such as Structural complexity theory that intersect with issues in Computable function.
Between 2009 and 2021, his most popular works were:
- Logical Foundations of Proof Complexity (124 citations)
- Complexity Theory for Operators in Analysis (48 citations)
- Exponential Lower Bounds for Monotone Span Programs (33 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Algebra
His primary scientific interests are in Discrete mathematics, Function, Combinatorics, Theoretical computer science and Algebra.
He regularly links together related areas like Proof complexity in his Discrete mathematics studies.
His Function research includes elements of Communication complexity, Exponential function and Conjecture.
His work carried out in the field of Combinatorics brings together such families of science as Nondeterministic algorithm and Binary decision diagram.
The various areas that Stephen A. Cook examines in his Theoretical computer science study include Representation, String, Computational complexity theory and Real number.
As a part of the same scientific family, he mostly works in the field of Algebra, focusing on Complexity class and, on occasion, Bipartite graph.
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.
