Polynomial Time Complexity

Polynomial Time Complexity is a computational complexity class that characterizes the set of decision problems solvable by a deterministic Turing machine in time bounded by a polynomial function of the input size.

7K

Publications

440.2K

Citations

10.7K

Authors

2.1K

Institutions

Publications per year

2017–2026

1.1K

Variants

Polynomial Time

Authors

10.7K

  1. MY
    Mihalis Yannakakis

    AT&T (United States), United States

    27 publications · 3.9K citations

    23

    h-index

  2. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    32 publications · 1.7K citations

    21

    h-index

  3. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    29 publications · 1.7K citations

    21

    h-index

  4. JC
    Jin‐Yi Cai

    University of Wisconsin–Madison, United States

    29 publications · 1K citations

    19

    h-index

  5. FV
    Fedor V. Fomin

    University of Bergen, Norway

    27 publications · 1.4K citations

    19

    h-index

1–5 of 10.7K

Venues

  1. SIAM Journal on Computing

    331 publications · 41K citations

    97

    h-index

  2. Journal of the ACM

    JACM · 131 publications · 25.4K citations

    74

    h-index

  3. arXiv (Cornell University)

    Repository · 311 publications · 9.4K citations

    43

    h-index

  4. IEEE Transactions on Information Theory

    76 publications · 9.7K citations

    40

    h-index

  5. Mathematics of Operations Research

    72 publications · 7.8K citations

    39

    h-index

1–5