D-Index & Metrics Best Publications

D-Index & Metrics

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
Mathematics D-index 40 Citations 8,343 133 World Ranking 1027 National Ranking 7

Overview

What is he best known for?

The fields of study he is best known for:

  • Algebra
  • Discrete mathematics
  • Real number

His main research concerns Discrete mathematics, Combinatorics, Upper and lower bounds, Bounded function and Polynomial. Particularly relevant to True arithmetic is his body of work in Discrete mathematics. Pavel Pudlák has researched True arithmetic in several fields, including Arithmetic, Metamathematics and Second-order arithmetic.

His research integrates issues of Computational complexity theory, Algorithm and Field in his study of Combinatorics. His Upper and lower bounds research is multidisciplinary, incorporating elements of Prime, Pigeonhole principle, Exponential function, Randomized algorithm and Conjunctive normal form. His work in Bounded function addresses subjects such as Probabilistic logic, which are connected to disciplines such as Class, Connectivity and Random variable.

His most cited work include:

  • Metamathematics of First-Order Arithmetic (538 citations)
  • Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations (344 citations)
  • Threshold circuits of bounded depth (206 citations)

What are the main themes of his work throughout his whole career to date?

His primary scientific interests are in Discrete mathematics, Combinatorics, Upper and lower bounds, Mathematical proof and Bounded function. Pavel Pudlák works in the field of Discrete mathematics, namely Boolean function. His research in Combinatorics intersects with topics in Matrix and Algebraic number.

His studies in Upper and lower bounds integrate themes in fields like Function, Modulo and Prime. His work carried out in the field of Mathematical proof brings together such families of science as Calculus and Resolution. Pavel Pudlák has included themes like Probabilistic logic and Constant in his Bounded function study.

He most often published in these fields:

  • Discrete mathematics (61.61%)
  • Combinatorics (41.96%)
  • Upper and lower bounds (20.09%)

What were the highlights of his more recent work (between 2015-2021)?

  • Discrete mathematics (61.61%)
  • Combinatorics (41.96%)
  • Upper and lower bounds (20.09%)

In recent papers he was focusing on the following fields of study:

Pavel Pudlák spends much of his time researching Discrete mathematics, Combinatorics, Upper and lower bounds, Boolean function and Proof complexity. His Discrete mathematics research includes themes of Lexicographical order and Interpolation. His Combinatorics research is multidisciplinary, incorporating perspectives in Ordinal number, Mirsky's theorem, Random variable and Finitary.

His Upper and lower bounds research incorporates themes from Linear system, Resolution and Pigeonhole principle. As part of the same scientific family, Pavel Pudlák usually focuses on Boolean function, concentrating on Binary number and intersecting with Joint entropy, Pairwise comparison, Variables and Entropy. The concepts of his Proof complexity study are interwoven with issues in Sentence and Theoretical computer science.

Between 2015 and 2021, his most popular works were:

  • Random Formulas, Monotone Circuits, and Interpolation (14 citations)
  • The complexity of proving that a graph is Ramsey (9 citations)
  • Incompleteness in the finite domain (8 citations)

In his most recent research, the most cited papers focused on:

  • Algebra
  • Real number
  • Discrete mathematics

Pavel Pudlák mainly investigates Discrete mathematics, Combinatorics, Upper and lower bounds, Unary operation and Binary number. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Quotient and Pure mathematics. His Upper and lower bounds research includes elements of Random variable, Resolution and Pigeonhole principle.

His research integrates issues of Mathematical proof, Polynomial and Equivalence in his study of Resolution. His study looks at the relationship between Unary operation and topics such as Open problem, which overlap with Boolean function. Pavel Pudlák interconnects Entropy, Joint entropy and Pairwise comparison in the investigation of issues within Binary number.

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.

Best Publications

Metamathematics of First-Order Arithmetic

Petr Hájek;Pavel Pudlák.
(1992)

1050 Citations

Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations

Pavel Pudlák.
Journal of Symbolic Logic (1997)

525 Citations

Threshold circuits of bounded depth

András Hajnal;András Hajnal;Wolfgang Maass;Wolfgang Maass;Pavel Pudlák;Pavel Pudlák;György Turán;György Turán.
Journal of Computer and System Sciences (1993)

463 Citations

Threshold circuits of bounded depth

Andras Hajnal;Wolfgang Maass;Pavel Pudlak;Mario Szegedy.
foundations of computer science (1987)

413 Citations

An improved exponential-time algorithm for k-SAT

Ramamohan Paturi;Pavel Pudlák;Michael E. Saks;Francis Zane.
Journal of the ACM (2005)

357 Citations

Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations

Jan Krajíček;Pavel Pudlák.
Journal of Symbolic Logic (1989)

219 Citations

Chapter VIII - The Lengths of Proofs

Pavel Pudlák.
Studies in logic and the foundations of mathematics (1998)

198 Citations

Bounded arithmetic and the polynomial hierarchy

Jan Krajíček;Pavel Pudlák;Gaisi Takeuti.
Annals of Pure and Applied Logic (1991)

188 Citations

An exponential lower bound to the size of bounded depth Frege proofs of the Pigeonhole Principle

Jan Krajíček;Pavel Pudlák;Alan Woods.
Random Structures and Algorithms (1995)

184 Citations

Cuts, consistency statements and interpretations

Pavel Pudlák.
Journal of Symbolic Logic (1985)

171 Citations

Best Scientists Citing Pavel Pudlák

Toniann Pitassi

Toniann Pitassi

University of Toronto

Publications: 65

Samuel R. Buss

Samuel R. Buss

University of California, San Diego

Publications: 54

Russell Impagliazzo

Russell Impagliazzo

University of California, San Diego

Publications: 41

Alexander A. Razborov

Alexander A. Razborov

University of Chicago

Publications: 32

Rocco A. Servedio

Rocco A. Servedio

Columbia University

Publications: 31

Avi Wigderson

Avi Wigderson

Institute for Advanced Study

Publications: 23

Ryan Williams

Ryan Williams

MIT

Publications: 22

Noga Alon

Noga Alon

Tel Aviv University

Publications: 22

Paul Beame

Paul Beame

University of Washington

Publications: 21

Stephen A. Cook

Stephen A. Cook

University of Toronto

Publications: 19

Amir Shpilka

Amir Shpilka

Tel Aviv University

Publications: 16

Wolfgang Maass

Wolfgang Maass

Graz University of Technology

Publications: 15

Petr Hájek

Petr Hájek

Czech Academy of Sciences

Publications: 14

Ran Raz

Ran Raz

Princeton University

Publications: 14

Kenneth L. McMillan

Kenneth L. McMillan

Microsoft (United States)

Publications: 14

Alan L. Selman

Alan L. Selman

University at Buffalo, State University of New York

Publications: 14

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us
Something went wrong. Please try again later.